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 <cassert> 16 17 #include "../../../min_allocator.h" 18 19 int main() 20 { 21 int a1[] = {1, 2, 3}; 22 { 23 std::vector<int> l1(a1, a1+3); 24 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); 25 assert(l1.size() == 3); 26 assert(distance(l1.cbegin(), l1.cend()) == 3); 27 assert(i == l1.begin()); 28 } 29 { 30 std::vector<int> l1(a1, a1+3); 31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); 32 assert(l1.size() == 2); 33 assert(distance(l1.cbegin(), l1.cend()) == 2); 34 assert(i == l1.begin()); 35 assert(l1 == std::vector<int>(a1+1, a1+3)); 36 } 37 { 38 std::vector<int> l1(a1, a1+3); 39 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); 40 assert(l1.size() == 1); 41 assert(distance(l1.cbegin(), l1.cend()) == 1); 42 assert(i == l1.begin()); 43 assert(l1 == std::vector<int>(a1+2, a1+3)); 44 } 45 { 46 std::vector<int> l1(a1, a1+3); 47 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); 48 assert(l1.size() == 0); 49 assert(distance(l1.cbegin(), l1.cend()) == 0); 50 assert(i == l1.begin()); 51 } 52 { 53 std::vector<std::vector<int> > outer(2, std::vector<int>(1)); 54 outer.erase(outer.begin(), outer.begin()); 55 assert(outer.size() == 2); 56 assert(outer[0].size() == 1); 57 assert(outer[1].size() == 1); 58 } 59 #if __cplusplus >= 201103L 60 { 61 std::vector<int, min_allocator<int>> l1(a1, a1+3); 62 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); 63 assert(l1.size() == 3); 64 assert(distance(l1.cbegin(), l1.cend()) == 3); 65 assert(i == l1.begin()); 66 } 67 { 68 std::vector<int, min_allocator<int>> l1(a1, a1+3); 69 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); 70 assert(l1.size() == 2); 71 assert(distance(l1.cbegin(), l1.cend()) == 2); 72 assert(i == l1.begin()); 73 assert((l1 == std::vector<int, min_allocator<int>>(a1+1, a1+3))); 74 } 75 { 76 std::vector<int, min_allocator<int>> l1(a1, a1+3); 77 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); 78 assert(l1.size() == 1); 79 assert(distance(l1.cbegin(), l1.cend()) == 1); 80 assert(i == l1.begin()); 81 assert((l1 == std::vector<int, min_allocator<int>>(a1+2, a1+3))); 82 } 83 { 84 std::vector<int, min_allocator<int>> l1(a1, a1+3); 85 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); 86 assert(l1.size() == 0); 87 assert(distance(l1.cbegin(), l1.cend()) == 0); 88 assert(i == l1.begin()); 89 } 90 { 91 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)); 92 outer.erase(outer.begin(), outer.begin()); 93 assert(outer.size() == 2); 94 assert(outer[0].size() == 1); 95 assert(outer[1].size() == 1); 96 } 97 #endif 98 } 99
