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
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
//
// REQUIRES: long_tests
// <deque>
// template <class InputIterator>
// iterator insert (const_iterator p, InputIterator f, InputIterator l);
#include <deque>
#include <cassert>
#include "test_iterators.h"
#include "../../../MoveOnly.h"
#include "../../../stack_allocator.h"
#include "min_allocator.h"
template <class C>
C
make(int size, int start = 0 )
{
const int b = 4096 / sizeof(int);
int init = 0;
if (start > 0)
{
init = (start+1) / b + ((start+1) % b != 0);
init *= b;
--init;
}
C c(init, 0);
for (int i = 0; i < init-start; ++i)
c.pop_back();
for (int i = 0; i < size; ++i)
c.push_back(i);
for (int i = 0; i < start; ++i)
c.pop_front();
return c;
};
template <class C>
void
test(int P, C& c1, const C& c2)
{
typedef typename C::iterator I;
typedef typename C::const_iterator CI;
typedef bidirectional_iterator<CI> BCI;
std::size_t c1_osize = c1.size();
CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end()));
assert(i == c1.begin() + P);
assert(c1.size() == c1_osize + c2.size());
assert(distance(c1.begin(), c1.end()) == c1.size());
i = c1.begin();
for (int j = 0; j < P; ++j, ++i)
assert(*i == j);
for (int j = 0; j < c2.size(); ++j, ++i)
assert(*i == j);
for (int j = P; j < c1_osize; ++j, ++i)
assert(*i == j);
}
template <class C>
void
testN(int start, int N, int M)
{
typedef typename C::iterator I;
typedef typename C::const_iterator CI;
for (int i = 0; i <= 3; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
test(i, c1, c2);
}
}
for (int i = M-1; i <= M+1; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
test(i, c1, c2);
}
}
for (int i = N/2-1; i <= N/2+1; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
test(i, c1, c2);
}
}
for (int i = N - M - 1; i <= N - M + 1; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
test(i, c1, c2);
}
}
for (int i = N - M - 1; i <= N - M + 1; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
test(i, c1, c2);
}
}
for (int i = N - 3; i <= N; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
test(i, c1, c2);
}
}
}
template <class C>
void
testI(int P, C& c1, const C& c2)
{
typedef typename C::iterator I;
typedef typename C::const_iterator CI;
typedef input_iterator<CI> ICI;
std::size_t c1_osize = c1.size();
CI i = c1.insert(c1.begin() + P, ICI(c2.begin()), ICI(c2.end()));
assert(i == c1.begin() + P);
assert(c1.size() == c1_osize + c2.size());
assert(distance(c1.begin(), c1.end()) == c1.size());
i = c1.begin();
for (int j = 0; j < P; ++j, ++i)
assert(*i == j);
for (int j = 0; j < c2.size(); ++j, ++i)
assert(*i == j);
for (int j = P; j < c1_osize; ++j, ++i)
assert(*i == j);
}
template <class C>
void
testNI(int start, int N, int M)
{
typedef typename C::iterator I;
typedef typename C::const_iterator CI;
for (int i = 0; i <= 3; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
testI(i, c1, c2);
}
}
for (int i = M-1; i <= M+1; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
testI(i, c1, c2);
}
}
for (int i = N/2-1; i <= N/2+1; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
testI(i, c1, c2);
}
}
for (int i = N - M - 1; i <= N - M + 1; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
testI(i, c1, c2);
}
}
for (int i = N - 3; i <= N; ++i)
{
if (0 <= i && i <= N)
{
C c1 = make<C>(N, start);
C c2 = make<C>(M);
testI(i, c1, c2);
}
}
}
template <class C>
void
test_move()
{
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
C c;
typedef typename C::const_iterator CI;
{
MoveOnly mo(0);
typedef MoveOnly* I;
c.insert(c.end(), std::move_iterator<I>(&mo), std::move_iterator<I>(&mo+1));
}
int j = 0;
for (CI i = c.begin(); i != c.end(); ++i, ++j)
assert(*i == MoveOnly(j));
{
MoveOnly mo(1);
typedef input_iterator<MoveOnly*> I;
c.insert(c.end(), std::move_iterator<I>(I(&mo)), std::move_iterator<I>(I(&mo+1)));
}
j = 0;
for (CI i = c.begin(); i != c.end(); ++i, ++j)
assert(*i == MoveOnly(j));
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
}
int main()
{
{
int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
const int N = sizeof(rng)/sizeof(rng[0]);
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
for (int k = 0; k < N; ++k)
testN<std::deque<int> >(rng[i], rng[j], rng[k]);
testNI<std::deque<int> >(1500, 2000, 1000);
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
test_move<std::deque<MoveOnly, stack_allocator<MoveOnly, 2000> > >();
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
}
#if __cplusplus >= 201103L
{
int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
const int N = sizeof(rng)/sizeof(rng[0]);
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
for (int k = 0; k < N; ++k)
testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]);
testNI<std::deque<int> >(1500, 2000, 1000);
test_move<std::deque<MoveOnly, min_allocator<MoveOnly> > >();
}
#endif
}
|
