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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <algorithm>
// template<ForwardIterator Iter1, ForwardIterator Iter2>
// requires HasSwap<Iter1::reference, Iter2::reference>
// Iter2
// swap_ranges(Iter1 first1, Iter1 last1, Iter2 first2);
#include <algorithm>
#include <cassert>
#include <memory>
#include "test_macros.h"
#include "test_iterators.h"
template<class Iter1, class Iter2>
void
test()
{
int i[3] = {1, 2, 3};
int j[3] = {4, 5, 6};
Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j));
assert(base(r) == j+3);
assert(i[0] == 4);
assert(i[1] == 5);
assert(i[2] == 6);
assert(j[0] == 1);
assert(j[1] == 2);
assert(j[2] == 3);
}
#if TEST_STD_VER >= 11
template<class Iter1, class Iter2>
void
test1()
{
std::unique_ptr<int> i[3];
for (int k = 0; k < 3; ++k)
i[k].reset(new int(k+1));
std::unique_ptr<int> j[3];
for (int k = 0; k < 3; ++k)
j[k].reset(new int(k+4));
Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j));
assert(base(r) == j+3);
assert(*i[0] == 4);
assert(*i[1] == 5);
assert(*i[2] == 6);
assert(*j[0] == 1);
assert(*j[1] == 2);
assert(*j[2] == 3);
}
#endif // TEST_STD_VER >= 11
void test2()
{
{
int src[2][2] = {{0, 1}, {2, 3}};
decltype(src) dest = {{9, 8}, {7, 6}};
std::swap(src, dest);
assert ( src[0][0] == 9 );
assert ( src[0][1] == 8 );
assert ( src[1][0] == 7 );
assert ( src[1][1] == 6 );
assert ( dest[0][0] == 0 );
assert ( dest[0][1] == 1 );
assert ( dest[1][0] == 2 );
assert ( dest[1][1] == 3 );
}
{
int src[3][3] = {{0, 1, 2}, {3, 4, 5}, {6, 7, 8}};
decltype(src) dest = {{9, 8, 7}, {6, 5, 4}, {3, 2, 1}};
std::swap(src, dest);
assert ( src[0][0] == 9 );
assert ( src[0][1] == 8 );
assert ( src[0][2] == 7 );
assert ( src[1][0] == 6 );
assert ( src[1][1] == 5 );
assert ( src[1][2] == 4 );
assert ( src[2][0] == 3 );
assert ( src[2][1] == 2 );
assert ( src[2][2] == 1 );
assert ( dest[0][0] == 0 );
assert ( dest[0][1] == 1 );
assert ( dest[0][2] == 2 );
assert ( dest[1][0] == 3 );
assert ( dest[1][1] == 4 );
assert ( dest[1][2] == 5 );
assert ( dest[2][0] == 6 );
assert ( dest[2][1] == 7 );
assert ( dest[2][2] == 8 );
}
}
int main()
{
test<forward_iterator<int*>, forward_iterator<int*> >();
test<forward_iterator<int*>, bidirectional_iterator<int*> >();
test<forward_iterator<int*>, random_access_iterator<int*> >();
test<forward_iterator<int*>, int*>();
test<bidirectional_iterator<int*>, forward_iterator<int*> >();
test<bidirectional_iterator<int*>, bidirectional_iterator<int*> >();
test<bidirectional_iterator<int*>, random_access_iterator<int*> >();
test<bidirectional_iterator<int*>, int*>();
test<random_access_iterator<int*>, forward_iterator<int*> >();
test<random_access_iterator<int*>, bidirectional_iterator<int*> >();
test<random_access_iterator<int*>, random_access_iterator<int*> >();
test<random_access_iterator<int*>, int*>();
test<int*, forward_iterator<int*> >();
test<int*, bidirectional_iterator<int*> >();
test<int*, random_access_iterator<int*> >();
test<int*, int*>();
#if TEST_STD_VER >= 11
test1<forward_iterator<std::unique_ptr<int>*>, forward_iterator<std::unique_ptr<int>*> >();
test1<forward_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >();
test1<forward_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >();
test1<forward_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
test1<bidirectional_iterator<std::unique_ptr<int>*>, forward_iterator<std::unique_ptr<int>*> >();
test1<bidirectional_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >();
test1<bidirectional_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >();
test1<bidirectional_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
test1<random_access_iterator<std::unique_ptr<int>*>, forward_iterator<std::unique_ptr<int>*> >();
test1<random_access_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >();
test1<random_access_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >();
test1<random_access_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
test1<std::unique_ptr<int>*, forward_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*, bidirectional_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >();
test1<std::unique_ptr<int>*, std::unique_ptr<int>*>();
#endif // TEST_STD_VER >= 11
test2();
}
|
