1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// <vector>
10// vector<bool>
11
12// template <class Iter>
13// iterator insert(const_iterator position, Iter first, Iter last);
14
15#include <vector>
16#include <cassert>
17#include <cstddef>
18
19#include "test_macros.h"
20#include "test_iterators.h"
21#include "min_allocator.h"
22
23TEST_CONSTEXPR_CXX20 bool tests() {
24 {
25 std::vector<bool> v(100);
26 bool a[] = {1, 0, 0, 1, 1};
27 const unsigned N = sizeof(a) / sizeof(a[0]);
28 std::vector<bool>::iterator i =
29 v.insert(v.cbegin() + 10, cpp17_input_iterator<const bool*>(a), cpp17_input_iterator<const bool*>(a + N));
30 assert(v.size() == 100 + N);
31 assert(i == v.begin() + 10);
32 std::size_t j;
33 for (j = 0; j < 10; ++j)
34 assert(v[j] == 0);
35 for (std::size_t k = 0; k < N; ++j, ++k)
36 assert(v[j] == a[k]);
37 for (; j < v.size(); ++j)
38 assert(v[j] == 0);
39 }
40 {
41 std::vector<bool> v(100);
42 bool a[] = {1, 0, 0, 1, 1};
43 const unsigned N = sizeof(a) / sizeof(a[0]);
44 std::vector<bool>::iterator i =
45 v.insert(v.cbegin() + 10, forward_iterator<const bool*>(a), forward_iterator<const bool*>(a + N));
46 assert(v.size() == 100 + N);
47 assert(i == v.begin() + 10);
48 int j;
49 for (j = 0; j < 10; ++j)
50 assert(v[j] == 0);
51 for (std::size_t k = 0; k < N; ++j, ++k)
52 assert(v[j] == a[k]);
53 for (; j < 105; ++j)
54 assert(v[j] == 0);
55 }
56 {
57 std::vector<bool> v(100);
58 while (v.size() < v.capacity())
59 v.push_back(x: false);
60 std::size_t sz = v.size();
61 bool a[] = {1, 0, 0, 1, 1};
62 const unsigned N = sizeof(a) / sizeof(a[0]);
63 std::vector<bool>::iterator i =
64 v.insert(v.cbegin() + 10, forward_iterator<const bool*>(a), forward_iterator<const bool*>(a + N));
65 assert(v.size() == sz + N);
66 assert(i == v.begin() + 10);
67 std::size_t j;
68 for (j = 0; j < 10; ++j)
69 assert(v[j] == 0);
70 for (std::size_t k = 0; k < N; ++j, ++k)
71 assert(v[j] == a[k]);
72 for (; j < v.size(); ++j)
73 assert(v[j] == 0);
74 }
75 {
76 std::vector<bool> v(100);
77 while (v.size() < v.capacity())
78 v.push_back(x: false);
79 v.pop_back();
80 v.pop_back();
81 v.pop_back();
82 std::size_t sz = v.size();
83 bool a[] = {1, 0, 0, 1, 1};
84 const unsigned N = sizeof(a) / sizeof(a[0]);
85 std::vector<bool>::iterator i =
86 v.insert(v.cbegin() + 10, forward_iterator<const bool*>(a), forward_iterator<const bool*>(a + N));
87 assert(v.size() == sz + N);
88 assert(i == v.begin() + 10);
89 std::size_t j;
90 for (j = 0; j < 10; ++j)
91 assert(v[j] == 0);
92 for (std::size_t k = 0; k < N; ++j, ++k)
93 assert(v[j] == a[k]);
94 for (; j < v.size(); ++j)
95 assert(v[j] == 0);
96 }
97#if TEST_STD_VER >= 11
98 {
99 std::vector<bool, explicit_allocator<bool>> v(100);
100 bool a[] = {1, 0, 0, 1, 1};
101 const unsigned N = sizeof(a) / sizeof(a[0]);
102 std::vector<bool, explicit_allocator<bool>>::iterator i =
103 v.insert(v.cbegin() + 10, cpp17_input_iterator<const bool*>(a), cpp17_input_iterator<const bool*>(a + N));
104 assert(v.size() == 100 + N);
105 assert(i == v.begin() + 10);
106 std::size_t j;
107 for (j = 0; j < 10; ++j)
108 assert(v[j] == 0);
109 for (std::size_t k = 0; k < N; ++j, ++k)
110 assert(v[j] == a[k]);
111 for (; j < v.size(); ++j)
112 assert(v[j] == 0);
113 }
114 {
115 std::vector<bool, min_allocator<bool>> v(100);
116 bool a[] = {1, 0, 0, 1, 1};
117 const unsigned N = sizeof(a) / sizeof(a[0]);
118 std::vector<bool, min_allocator<bool>>::iterator i =
119 v.insert(v.cbegin() + 10, cpp17_input_iterator<const bool*>(a), cpp17_input_iterator<const bool*>(a + N));
120 assert(v.size() == 100 + N);
121 assert(i == v.begin() + 10);
122 std::size_t j;
123 for (j = 0; j < 10; ++j)
124 assert(v[j] == 0);
125 for (std::size_t k = 0; k < N; ++j, ++k)
126 assert(v[j] == a[k]);
127 for (; j < v.size(); ++j)
128 assert(v[j] == 0);
129 }
130 {
131 std::vector<bool, min_allocator<bool>> v(100);
132 bool a[] = {1, 0, 0, 1, 1};
133 const unsigned N = sizeof(a) / sizeof(a[0]);
134 std::vector<bool, min_allocator<bool>>::iterator i =
135 v.insert(v.cbegin() + 10, forward_iterator<const bool*>(a), forward_iterator<const bool*>(a + N));
136 assert(v.size() == 100 + N);
137 assert(i == v.begin() + 10);
138 std::size_t j;
139 for (j = 0; j < 10; ++j)
140 assert(v[j] == 0);
141 for (std::size_t k = 0; k < N; ++j, ++k)
142 assert(v[j] == a[k]);
143 for (; j < v.size(); ++j)
144 assert(v[j] == 0);
145 }
146#endif
147
148 return true;
149}
150
151int main(int, char**) {
152 tests();
153#if TEST_STD_VER > 17
154 static_assert(tests());
155#endif
156 return 0;
157}
158

source code of libcxx/test/std/containers/sequences/vector.bool/insert_iter_iter_iter.pass.cpp