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
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <vector>
// template <class InputIt>
// constexpr void assign(InputIt first, InputIt last);
#include <vector>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
TEST_CONSTEXPR_CXX20 bool tests() {
{ // Test with various cases where assign may or may not trigger reallocations for forward_iterator
{ // Reallocation happens
std::vector<bool> in(128, true);
std::vector<bool> v(5, false);
assert(v.capacity() < in.size());
using It = forward_iterator<std::vector<bool>::iterator>;
v.assign(It(in.begin()), It(in.end()));
assert(v == in);
}
{ // No reallocation: fit within current size
bool in[] = {false, true, false, true, true};
std::size_t N = sizeof(in) / sizeof(in[0]);
std::vector<bool> v(2 * N, false);
using It = forward_iterator<bool*>;
v.assign(It(in), It(in + N));
assert(v.size() == N);
for (std::size_t i = 0; i < N; ++i)
assert(v[i] == in[i]);
}
{ // No reallocation: fit within spare space
bool in[] = {false, true, false, true, true};
std::size_t N = sizeof(in) / sizeof(in[0]);
std::vector<bool> v(N / 2, false);
v.reserve(N * 2);
using It = forward_iterator<bool*>;
v.assign(It(in), It(in + N));
assert(v.size() == N);
for (std::size_t i = 0; i < N; ++i)
assert(v[i] == in[i]);
}
}
{ // Test with various cases where assign may or may not trigger reallocations for input_iterator
{ // Reallocation happens
std::vector<bool> in(128, true);
std::vector<bool> v(5, false);
assert(v.capacity() < in.size());
using It = cpp17_input_iterator<std::vector<bool>::iterator>;
v.assign(It(in.begin()), It(in.end()));
assert(v == in);
}
{ // No reallocation: fit within current size
bool in[] = {false, true, false, true, true};
std::size_t N = sizeof(in) / sizeof(in[0]);
std::vector<bool> v(2 * N, false);
using It = cpp17_input_iterator<bool*>;
v.assign(It(in), It(in + N));
assert(v.size() == N);
for (std::size_t i = 0; i < N; ++i)
assert(v[i] == in[i]);
}
{ // No reallocation: fit within spare space
bool in[] = {false, true, false, true, true};
std::size_t N = sizeof(in) / sizeof(in[0]);
std::vector<bool> v(N / 2, false);
v.reserve(N * 2);
using It = cpp17_input_iterator<bool*>;
v.assign(It(in), It(in + N));
assert(v.size() == N);
for (std::size_t i = 0; i < N; ++i)
assert(v[i] == in[i]);
}
}
return true;
}
int main(int, char**) {
tests();
#if TEST_STD_VER > 17
static_assert(tests());
#endif
return 0;
}
|
