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
|
//===----------------------------------------------------------------------===//
//
// 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
// UNSUPPORTED: libcpp-no-concepts
// UNSUPPORTED: gcc-10
// template<class I>
// unspecified iter_swap;
#include <iterator>
#include <array>
#include <cassert>
#include "./unqualified_lookup_wrapper.h"
#include "test_iterators.h"
using IterSwapT = decltype(std::ranges::iter_swap);
static_assert(std::semiregular<std::remove_cv_t<IterSwapT>>);
struct HasIterSwap {
int &value_;
explicit HasIterSwap(int &value) : value_(value) { assert(value == 0); }
friend constexpr void iter_swap(HasIterSwap& a, HasIterSwap& b) {
a.value_ = 1;
b.value_ = 1;
}
friend constexpr void iter_swap(HasIterSwap& a, int& b) {
a.value_ = 2;
b = 2;
}
};
static_assert( std::is_invocable_v<IterSwapT, HasIterSwap&, HasIterSwap&>);
static_assert( std::is_invocable_v<IterSwapT, HasIterSwap&, int&>);
static_assert(!std::is_invocable_v<IterSwapT, int&, HasIterSwap&>);
static_assert( std::is_invocable_v<IterSwapT&, HasIterSwap&, HasIterSwap&>);
static_assert( std::is_invocable_v<IterSwapT&, HasIterSwap&, int&>);
static_assert(!std::is_invocable_v<IterSwapT&, int&, HasIterSwap&>);
static_assert( std::is_invocable_v<IterSwapT&&, HasIterSwap&, HasIterSwap&>);
static_assert( std::is_invocable_v<IterSwapT&&, HasIterSwap&, int&>);
static_assert(!std::is_invocable_v<IterSwapT&&, int&, HasIterSwap&>);
struct NodiscardIterSwap {
[[nodiscard]] friend int iter_swap(NodiscardIterSwap&, NodiscardIterSwap&) { return 0; }
};
void ensureVoidCast(NodiscardIterSwap& a, NodiscardIterSwap& b) { std::ranges::iter_swap(a, b); }
struct HasRangesSwap {
int &value_;
explicit HasRangesSwap(int &value) : value_(value) { assert(value == 0); }
friend constexpr void swap(HasRangesSwap& a, HasRangesSwap& b) {
a.value_ = 1;
b.value_ = 1;
}
friend constexpr void swap(HasRangesSwap& a, int& b) {
a.value_ = 2;
b = 2;
}
};
struct HasRangesSwapWrapper {
using value_type = HasRangesSwap;
HasRangesSwap &value_;
explicit HasRangesSwapWrapper(HasRangesSwap &value) : value_(value) {}
HasRangesSwap& operator*() const { return value_; }
};
static_assert( std::is_invocable_v<IterSwapT, HasRangesSwapWrapper&, HasRangesSwapWrapper&>);
// Does not satisfy swappable_with, even though swap(X, Y) is valid.
static_assert(!std::is_invocable_v<IterSwapT, HasRangesSwapWrapper&, int&>);
static_assert(!std::is_invocable_v<IterSwapT, int&, HasRangesSwapWrapper&>);
struct B;
struct A {
bool value = false;
A& operator=(const B&) {
value = true;
return *this;
};
};
struct B {
bool value = false;
B& operator=(const A&) {
value = true;
return *this;
};
};
struct MoveOnly2;
struct MoveOnly1 {
bool value = false;
MoveOnly1() = default;
MoveOnly1(MoveOnly1&&) = default;
MoveOnly1& operator=(MoveOnly1&&) = default;
MoveOnly1(const MoveOnly1&) = delete;
MoveOnly1& operator=(const MoveOnly1&) = delete;
MoveOnly1& operator=(MoveOnly2 &&) {
value = true;
return *this;
};
};
struct MoveOnly2 {
bool value = false;
MoveOnly2() = default;
MoveOnly2(MoveOnly2&&) = default;
MoveOnly2& operator=(MoveOnly2&&) = default;
MoveOnly2(const MoveOnly2&) = delete;
MoveOnly2& operator=(const MoveOnly2&) = delete;
MoveOnly2& operator=(MoveOnly1 &&) {
value = true;
return *this;
};
};
int main(int, char**) {
{
int value1 = 0;
int value2 = 0;
HasIterSwap a(value1), b(value2);
std::ranges::iter_swap(a, b);
assert(value1 == 1 && value2 == 1);
}
{
int value1 = 0;
int value2 = 0;
HasRangesSwap c(value1), d(value2);
HasRangesSwapWrapper cWrapper(c), dWrapper(d);
std::ranges::iter_swap(cWrapper, dWrapper);
assert(value1 == 1 && value2 == 1);
}
{
int value1 = 0;
int value2 = 0;
HasRangesSwap c(value1), d(value2);
std::ranges::iter_swap(HasRangesSwapWrapper(c), HasRangesSwapWrapper(d));
assert(value1 == 1 && value2 == 1);
}
{
A e; B f;
A *ePtr = &e;
B *fPtr = &f;
std::ranges::iter_swap(ePtr, fPtr);
assert(e.value && f.value);
}
{
MoveOnly1 g; MoveOnly2 h;
std::ranges::iter_swap(&g, &h);
assert(g.value && h.value);
}
{
auto arr = std::array<move_tracker, 2>();
std::ranges::iter_swap(arr.begin(), arr.begin() + 1);
assert(arr[0].moves() == 1 && arr[1].moves() == 2);
}
{
int buff[2] = {1, 2};
std::ranges::iter_swap(buff + 0, buff + 1);
assert(buff[0] == 2 && buff[1] == 1);
std::ranges::iter_swap(cpp20_input_iterator(buff), cpp20_input_iterator(buff + 1));
assert(buff[0] == 1 && buff[1] == 2);
std::ranges::iter_swap(cpp17_input_iterator(buff), cpp17_input_iterator(buff + 1));
assert(buff[0] == 2 && buff[1] == 1);
std::ranges::iter_swap(forward_iterator(buff), forward_iterator(buff + 1));
assert(buff[0] == 1 && buff[1] == 2);
std::ranges::iter_swap(bidirectional_iterator(buff), bidirectional_iterator(buff + 1));
assert(buff[0] == 2 && buff[1] == 1);
std::ranges::iter_swap(random_access_iterator(buff), random_access_iterator(buff + 1));
assert(buff[0] == 1 && buff[1] == 2);
std::ranges::iter_swap(contiguous_iterator(buff), contiguous_iterator(buff + 1));
assert(buff[0] == 2 && buff[1] == 1);
}
return 0;
}
|
