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 position); 13 14 #include <vector> 15 #include <cassert> 16 17 #include "min_allocator.h" 18 #include "asan_testing.h" 19 20 int main() 21 { 22 { 23 int a1[] = {1, 2, 3}; 24 std::vector<int> l1(a1, a1+3); 25 std::vector<int>::const_iterator i = l1.begin(); 26 assert(is_contiguous_container_asan_correct(l1)); 27 ++i; 28 std::vector<int>::iterator j = l1.erase(i); 29 assert(l1.size() == 2); 30 assert(distance(l1.begin(), l1.end()) == 2); 31 assert(*j == 3); 32 assert(*l1.begin() == 1); 33 assert(*next(l1.begin()) == 3); 34 assert(is_contiguous_container_asan_correct(l1)); 35 j = l1.erase(j); 36 assert(j == l1.end()); 37 assert(l1.size() == 1); 38 assert(distance(l1.begin(), l1.end()) == 1); 39 assert(*l1.begin() == 1); 40 assert(is_contiguous_container_asan_correct(l1)); 41 j = l1.erase(l1.begin()); 42 assert(j == l1.end()); 43 assert(l1.size() == 0); 44 assert(distance(l1.begin(), l1.end()) == 0); 45 assert(is_contiguous_container_asan_correct(l1)); 46 } 47 #if __cplusplus >= 201103L 48 { 49 int a1[] = {1, 2, 3}; 50 std::vector<int, min_allocator<int>> l1(a1, a1+3); 51 std::vector<int, min_allocator<int>>::const_iterator i = l1.begin(); 52 assert(is_contiguous_container_asan_correct(l1)); 53 ++i; 54 std::vector<int, min_allocator<int>>::iterator j = l1.erase(i); 55 assert(l1.size() == 2); 56 assert(distance(l1.begin(), l1.end()) == 2); 57 assert(*j == 3); 58 assert(*l1.begin() == 1); 59 assert(*next(l1.begin()) == 3); 60 assert(is_contiguous_container_asan_correct(l1)); 61 j = l1.erase(j); 62 assert(j == l1.end()); 63 assert(l1.size() == 1); 64 assert(distance(l1.begin(), l1.end()) == 1); 65 assert(*l1.begin() == 1); 66 assert(is_contiguous_container_asan_correct(l1)); 67 j = l1.erase(l1.begin()); 68 assert(j == l1.end()); 69 assert(l1.size() == 0); 70 assert(distance(l1.begin(), l1.end()) == 0); 71 assert(is_contiguous_container_asan_correct(l1)); 72 } 73 #endif 74 } 75
