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 // UNSUPPORTED: c++98, c++03 11 12 // <vector> 13 14 // vector(vector&& c); 15 16 #include <vector> 17 #include <cassert> 18 #include "MoveOnly.h" 19 #include "test_allocator.h" 20 #include "min_allocator.h" 21 #include "asan_testing.h" 22 23 int main() 24 { 25 { 26 std::vector<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5)); 27 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 28 assert(is_contiguous_container_asan_correct(l)); 29 assert(is_contiguous_container_asan_correct(lo)); 30 for (int i = 1; i <= 3; ++i) 31 { 32 l.push_back(i); 33 lo.push_back(i); 34 } 35 assert(is_contiguous_container_asan_correct(l)); 36 assert(is_contiguous_container_asan_correct(lo)); 37 std::vector<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l); 38 assert(l2 == lo); 39 assert(l.empty()); 40 assert(l2.get_allocator() == lo.get_allocator()); 41 assert(is_contiguous_container_asan_correct(l2)); 42 } 43 { 44 std::vector<MoveOnly, other_allocator<MoveOnly> > l(other_allocator<MoveOnly>(5)); 45 std::vector<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 46 assert(is_contiguous_container_asan_correct(l)); 47 assert(is_contiguous_container_asan_correct(lo)); 48 for (int i = 1; i <= 3; ++i) 49 { 50 l.push_back(i); 51 lo.push_back(i); 52 } 53 assert(is_contiguous_container_asan_correct(l)); 54 assert(is_contiguous_container_asan_correct(lo)); 55 std::vector<MoveOnly, other_allocator<MoveOnly> > l2 = std::move(l); 56 assert(l2 == lo); 57 assert(l.empty()); 58 assert(l2.get_allocator() == lo.get_allocator()); 59 assert(is_contiguous_container_asan_correct(l2)); 60 } 61 { 62 int a1[] = {1, 3, 7, 9, 10}; 63 std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 64 assert(is_contiguous_container_asan_correct(c1)); 65 std::vector<int>::const_iterator i = c1.begin(); 66 std::vector<int> c2 = std::move(c1); 67 assert(is_contiguous_container_asan_correct(c2)); 68 std::vector<int>::iterator j = c2.erase(i); 69 assert(*j == 3); 70 assert(is_contiguous_container_asan_correct(c2)); 71 } 72 { 73 std::vector<MoveOnly, min_allocator<MoveOnly> > l(min_allocator<MoveOnly>{}); 74 std::vector<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{}); 75 assert(is_contiguous_container_asan_correct(l)); 76 assert(is_contiguous_container_asan_correct(lo)); 77 for (int i = 1; i <= 3; ++i) 78 { 79 l.push_back(i); 80 lo.push_back(i); 81 } 82 assert(is_contiguous_container_asan_correct(l)); 83 assert(is_contiguous_container_asan_correct(lo)); 84 std::vector<MoveOnly, min_allocator<MoveOnly> > l2 = std::move(l); 85 assert(l2 == lo); 86 assert(l.empty()); 87 assert(l2.get_allocator() == lo.get_allocator()); 88 assert(is_contiguous_container_asan_correct(l2)); 89 } 90 { 91 int a1[] = {1, 3, 7, 9, 10}; 92 std::vector<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 93 assert(is_contiguous_container_asan_correct(c1)); 94 std::vector<int, min_allocator<int>>::const_iterator i = c1.begin(); 95 std::vector<int, min_allocator<int>> c2 = std::move(c1); 96 assert(is_contiguous_container_asan_correct(c2)); 97 std::vector<int, min_allocator<int>>::iterator j = c2.erase(i); 98 assert(*j == 3); 99 assert(is_contiguous_container_asan_correct(c2)); 100 } 101 } 102
