1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
12 // template <class Iter>
13 // iterator insert(const_iterator position, Iter first, Iter last);
15 #if _LIBCPP_DEBUG >= 1
16 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
21 #include "../../../stack_allocator.h"
22 #include "test_iterators.h"
23 #include "min_allocator.h"
24 #include "asan_testing.h"
29 std::vector<int> v(100);
30 int a[] = {1, 2, 3, 4, 5};
31 const int N = sizeof(a)/sizeof(a[0]);
32 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const int*>(a),
33 input_iterator<const int*>(a+N));
34 assert(v.size() == 100 + N);
35 assert(is_contiguous_container_asan_correct(v));
36 assert(i == v.begin() + 10);
38 for (j = 0; j < 10; ++j)
40 for (int k = 0; k < N; ++j, ++k)
46 std::vector<int> v(100);
47 int a[] = {1, 2, 3, 4, 5};
48 const int N = sizeof(a)/sizeof(a[0]);
49 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const int*>(a),
50 forward_iterator<const int*>(a+N));
51 assert(v.size() == 100 + N);
52 assert(is_contiguous_container_asan_correct(v));
53 assert(i == v.begin() + 10);
55 for (j = 0; j < 10; ++j)
57 for (int k = 0; k < N; ++j, ++k)
63 std::vector<int, stack_allocator<int, 308> > v(100);
64 int a[] = {1, 2, 3, 4, 5};
65 const int N = sizeof(a)/sizeof(a[0]);
66 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const int*>(a),
67 input_iterator<const int*>(a+N));
68 assert(v.size() == 100 + N);
69 assert(is_contiguous_container_asan_correct(v));
70 assert(i == v.begin() + 10);
72 for (j = 0; j < 10; ++j)
74 for (int k = 0; k < N; ++j, ++k)
80 std::vector<int, stack_allocator<int, 300> > v(100);
81 int a[] = {1, 2, 3, 4, 5};
82 const int N = sizeof(a)/sizeof(a[0]);
83 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const int*>(a),
84 forward_iterator<const int*>(a+N));
85 assert(v.size() == 100 + N);
86 assert(is_contiguous_container_asan_correct(v));
87 assert(i == v.begin() + 10);
89 for (j = 0; j < 10; ++j)
91 for (int k = 0; k < N; ++j, ++k)
96 #if _LIBCPP_DEBUG >= 1
98 std::vector<int> v(100);
99 std::vector<int> v2(100);
100 int a[] = {1, 2, 3, 4, 5};
101 const int N = sizeof(a)/sizeof(a[0]);
102 std::vector<int>::iterator i = v.insert(v2.cbegin() + 10, input_iterator<const int*>(a),
103 input_iterator<const int*>(a+N));
107 #if __cplusplus >= 201103L
109 std::vector<int, min_allocator<int>> v(100);
110 int a[] = {1, 2, 3, 4, 5};
111 const int N = sizeof(a)/sizeof(a[0]);
112 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, input_iterator<const int*>(a),
113 input_iterator<const int*>(a+N));
114 assert(v.size() == 100 + N);
115 assert(is_contiguous_container_asan_correct(v));
116 assert(i == v.begin() + 10);
118 for (j = 0; j < 10; ++j)
120 for (int k = 0; k < N; ++j, ++k)
121 assert(v[j] == a[k]);
126 std::vector<int, min_allocator<int>> v(100);
127 int a[] = {1, 2, 3, 4, 5};
128 const int N = sizeof(a)/sizeof(a[0]);
129 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, forward_iterator<const int*>(a),
130 forward_iterator<const int*>(a+N));
131 assert(v.size() == 100 + N);
132 assert(is_contiguous_container_asan_correct(v));
133 assert(i == v.begin() + 10);
135 for (j = 0; j < 10; ++j)
137 for (int k = 0; k < N; ++j, ++k)
138 assert(v[j] == a[k]);
142 #if _LIBCPP_DEBUG >= 1
144 std::vector<int, min_allocator<int>> v(100);
145 std::vector<int, min_allocator<int>> v2(100);
146 int a[] = {1, 2, 3, 4, 5};
147 const int N = sizeof(a)/sizeof(a[0]);
148 std::vector<int, min_allocator<int>>::iterator i = v.insert(v2.cbegin() + 10, input_iterator<const int*>(a),
149 input_iterator<const int*>(a+N));