1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <vector> 11 12 // iterator insert(const_iterator position, size_type n, const value_type& x); 13 14 #if _LIBCPP_DEBUG >= 1 15 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) 16 #endif 17 18 #include <vector> 19 #include <cassert> 20 #include "../../../stack_allocator.h" 21 #include "min_allocator.h" 22 #include "asan_testing.h" 23 24 int main() 25 { 26 { 27 std::vector<int> v(100); 28 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 29 assert(v.size() == 105); 30 assert(is_contiguous_container_asan_correct(v)); 31 assert(i == v.begin() + 10); 32 int j; 33 for (j = 0; j < 10; ++j) 34 assert(v[j] == 0); 35 for (; j < 15; ++j) 36 assert(v[j] == 1); 37 for (++j; j < 105; ++j) 38 assert(v[j] == 0); 39 } 40 { 41 std::vector<int> v(100); 42 while(v.size() < v.capacity()) v.push_back(0); // force reallocation 43 size_t sz = v.size(); 44 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 45 assert(v.size() == sz + 5); 46 assert(is_contiguous_container_asan_correct(v)); 47 assert(i == v.begin() + 10); 48 int j; 49 for (j = 0; j < 10; ++j) 50 assert(v[j] == 0); 51 for (; j < 15; ++j) 52 assert(v[j] == 1); 53 for (++j; j < v.size(); ++j) 54 assert(v[j] == 0); 55 } 56 { 57 std::vector<int> v(100); 58 v.reserve(128); // force no reallocation 59 size_t sz = v.size(); 60 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 61 assert(v.size() == sz + 5); 62 assert(is_contiguous_container_asan_correct(v)); 63 assert(i == v.begin() + 10); 64 int j; 65 for (j = 0; j < 10; ++j) 66 assert(v[j] == 0); 67 for (; j < 15; ++j) 68 assert(v[j] == 1); 69 for (++j; j < v.size(); ++j) 70 assert(v[j] == 0); 71 } 72 { 73 std::vector<int, stack_allocator<int, 300> > v(100); 74 std::vector<int, stack_allocator<int, 300> >::iterator i = v.insert(v.cbegin() + 10, 5, 1); 75 assert(v.size() == 105); 76 assert(is_contiguous_container_asan_correct(v)); 77 assert(i == v.begin() + 10); 78 int j; 79 for (j = 0; j < 10; ++j) 80 assert(v[j] == 0); 81 for (; j < 15; ++j) 82 assert(v[j] == 1); 83 for (++j; j < 105; ++j) 84 assert(v[j] == 0); 85 } 86 #if _LIBCPP_DEBUG >= 1 87 { 88 std::vector<int> c1(100); 89 std::vector<int> c2; 90 std::vector<int>::iterator i = c1.insert(c2.cbegin() + 10, 5, 1); 91 assert(false); 92 } 93 #endif 94 #if __cplusplus >= 201103L 95 { 96 std::vector<int, min_allocator<int>> v(100); 97 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 98 assert(v.size() == 105); 99 assert(is_contiguous_container_asan_correct(v)); 100 assert(i == v.begin() + 10); 101 int j; 102 for (j = 0; j < 10; ++j) 103 assert(v[j] == 0); 104 for (; j < 15; ++j) 105 assert(v[j] == 1); 106 for (++j; j < 105; ++j) 107 assert(v[j] == 0); 108 } 109 { 110 std::vector<int, min_allocator<int>> v(100); 111 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, 5, 1); 112 assert(v.size() == 105); 113 assert(is_contiguous_container_asan_correct(v)); 114 assert(i == v.begin() + 10); 115 int j; 116 for (j = 0; j < 10; ++j) 117 assert(v[j] == 0); 118 for (; j < 15; ++j) 119 assert(v[j] == 1); 120 for (++j; j < 105; ++j) 121 assert(v[j] == 0); 122 } 123 #if _LIBCPP_DEBUG >= 1 124 { 125 std::vector<int, min_allocator<int>> c1(100); 126 std::vector<int, min_allocator<int>> c2; 127 std::vector<int, min_allocator<int>>::iterator i = c1.insert(c2.cbegin() + 10, 5, 1); 128 assert(false); 129 } 130 #endif 131 #endif 132 } 133
