erase_iter_iter.pass.cpp (6177B)
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 erase(const_iterator first, const_iterator last); 13 14 #include <vector> 15 #include <iterator> 16 #include <cassert> 17 18 #include "min_allocator.h" 19 #include "asan_testing.h" 20 21 #ifndef TEST_HAS_NO_EXCEPTIONS 22 struct Throws { 23 Throws() : v_(0) {} 24 Throws(int v) : v_(v) {} 25 Throws(const Throws &rhs) : v_(rhs.v_) { if (sThrows) throw 1; } 26 Throws( Throws &&rhs) : v_(rhs.v_) { if (sThrows) throw 1; } 27 Throws& operator=(const Throws &rhs) { v_ = rhs.v_; return *this; } 28 Throws& operator=( Throws &&rhs) { v_ = rhs.v_; return *this; } 29 int v_; 30 static bool sThrows; 31 }; 32 33 bool Throws::sThrows = false; 34 #endif 35 36 int main() 37 { 38 int a1[] = {1, 2, 3}; 39 { 40 std::vector<int> l1(a1, a1+3); 41 assert(is_contiguous_container_asan_correct(l1)); 42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); 43 assert(l1.size() == 3); 44 assert(distance(l1.cbegin(), l1.cend()) == 3); 45 assert(i == l1.begin()); 46 assert(is_contiguous_container_asan_correct(l1)); 47 } 48 { 49 std::vector<int> l1(a1, a1+3); 50 assert(is_contiguous_container_asan_correct(l1)); 51 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); 52 assert(l1.size() == 2); 53 assert(distance(l1.cbegin(), l1.cend()) == 2); 54 assert(i == l1.begin()); 55 assert(l1 == std::vector<int>(a1+1, a1+3)); 56 assert(is_contiguous_container_asan_correct(l1)); 57 } 58 { 59 std::vector<int> l1(a1, a1+3); 60 assert(is_contiguous_container_asan_correct(l1)); 61 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); 62 assert(l1.size() == 1); 63 assert(distance(l1.cbegin(), l1.cend()) == 1); 64 assert(i == l1.begin()); 65 assert(l1 == std::vector<int>(a1+2, a1+3)); 66 assert(is_contiguous_container_asan_correct(l1)); 67 } 68 { 69 std::vector<int> l1(a1, a1+3); 70 assert(is_contiguous_container_asan_correct(l1)); 71 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); 72 assert(l1.size() == 0); 73 assert(distance(l1.cbegin(), l1.cend()) == 0); 74 assert(i == l1.begin()); 75 assert(is_contiguous_container_asan_correct(l1)); 76 } 77 { 78 std::vector<std::vector<int> > outer(2, std::vector<int>(1)); 79 assert(is_contiguous_container_asan_correct(outer)); 80 assert(is_contiguous_container_asan_correct(outer[0])); 81 assert(is_contiguous_container_asan_correct(outer[1])); 82 outer.erase(outer.begin(), outer.begin()); 83 assert(outer.size() == 2); 84 assert(outer[0].size() == 1); 85 assert(outer[1].size() == 1); 86 assert(is_contiguous_container_asan_correct(outer)); 87 assert(is_contiguous_container_asan_correct(outer[0])); 88 assert(is_contiguous_container_asan_correct(outer[1])); 89 } 90 #if TEST_STD_VER >= 11 91 { 92 std::vector<int, min_allocator<int>> l1(a1, a1+3); 93 assert(is_contiguous_container_asan_correct(l1)); 94 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); 95 assert(l1.size() == 3); 96 assert(distance(l1.cbegin(), l1.cend()) == 3); 97 assert(i == l1.begin()); 98 assert(is_contiguous_container_asan_correct(l1)); 99 } 100 { 101 std::vector<int, min_allocator<int>> l1(a1, a1+3); 102 assert(is_contiguous_container_asan_correct(l1)); 103 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); 104 assert(l1.size() == 2); 105 assert(distance(l1.cbegin(), l1.cend()) == 2); 106 assert(i == l1.begin()); 107 assert((l1 == std::vector<int, min_allocator<int>>(a1+1, a1+3))); 108 assert(is_contiguous_container_asan_correct(l1)); 109 } 110 { 111 std::vector<int, min_allocator<int>> l1(a1, a1+3); 112 assert(is_contiguous_container_asan_correct(l1)); 113 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); 114 assert(l1.size() == 1); 115 assert(distance(l1.cbegin(), l1.cend()) == 1); 116 assert(i == l1.begin()); 117 assert((l1 == std::vector<int, min_allocator<int>>(a1+2, a1+3))); 118 assert(is_contiguous_container_asan_correct(l1)); 119 } 120 { 121 std::vector<int, min_allocator<int>> l1(a1, a1+3); 122 assert(is_contiguous_container_asan_correct(l1)); 123 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); 124 assert(l1.size() == 0); 125 assert(distance(l1.cbegin(), l1.cend()) == 0); 126 assert(i == l1.begin()); 127 assert(is_contiguous_container_asan_correct(l1)); 128 } 129 { 130 std::vector<std::vector<int, min_allocator<int>>, min_allocator<std::vector<int, min_allocator<int>>>> outer(2, std::vector<int, min_allocator<int>>(1)); 131 assert(is_contiguous_container_asan_correct(outer)); 132 assert(is_contiguous_container_asan_correct(outer[0])); 133 assert(is_contiguous_container_asan_correct(outer[1])); 134 outer.erase(outer.begin(), outer.begin()); 135 assert(outer.size() == 2); 136 assert(outer[0].size() == 1); 137 assert(outer[1].size() == 1); 138 assert(is_contiguous_container_asan_correct(outer)); 139 assert(is_contiguous_container_asan_correct(outer[0])); 140 assert(is_contiguous_container_asan_correct(outer[1])); 141 } 142 #endif 143 #ifndef TEST_HAS_NO_EXCEPTIONS 144 // Test for LWG2853: 145 // Throws: Nothing unless an exception is thrown by the assignment operator or move assignment operator of T. 146 { 147 Throws arr[] = {1, 2, 3}; 148 std::vector<Throws> v(arr, arr+3); 149 Throws::sThrows = true; 150 v.erase(v.begin(), --v.end()); 151 assert(v.size() == 1); 152 v.erase(v.begin(), v.end()); 153 assert(v.size() == 0); 154 } 155 #endif 156 }