//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // UNSUPPORTED: c++98, c++03 // // vector(vector&& c); #include #include #include "test_macros.h" #include "MoveOnly.h" #include "test_allocator.h" #include "min_allocator.h" #include "asan_testing.h" int main() { { std::vector > l(test_allocator(5)); std::vector > lo(test_allocator(5)); assert(is_contiguous_container_asan_correct(l)); assert(is_contiguous_container_asan_correct(lo)); for (int i = 1; i <= 3; ++i) { l.push_back(i); lo.push_back(i); } assert(is_contiguous_container_asan_correct(l)); assert(is_contiguous_container_asan_correct(lo)); std::vector > l2 = std::move(l); assert(l2 == lo); assert(l.empty()); assert(l2.get_allocator() == lo.get_allocator()); assert(is_contiguous_container_asan_correct(l2)); } { std::vector > l(other_allocator(5)); std::vector > lo(other_allocator(5)); assert(is_contiguous_container_asan_correct(l)); assert(is_contiguous_container_asan_correct(lo)); for (int i = 1; i <= 3; ++i) { l.push_back(i); lo.push_back(i); } assert(is_contiguous_container_asan_correct(l)); assert(is_contiguous_container_asan_correct(lo)); std::vector > l2 = std::move(l); assert(l2 == lo); assert(l.empty()); assert(l2.get_allocator() == lo.get_allocator()); assert(is_contiguous_container_asan_correct(l2)); } { int a1[] = {1, 3, 7, 9, 10}; std::vector c1(a1, a1+sizeof(a1)/sizeof(a1[0])); assert(is_contiguous_container_asan_correct(c1)); std::vector::const_iterator i = c1.begin(); std::vector c2 = std::move(c1); assert(is_contiguous_container_asan_correct(c2)); std::vector::iterator j = c2.erase(i); assert(*j == 3); assert(is_contiguous_container_asan_correct(c2)); } { std::vector > l(min_allocator{}); std::vector > lo(min_allocator{}); assert(is_contiguous_container_asan_correct(l)); assert(is_contiguous_container_asan_correct(lo)); for (int i = 1; i <= 3; ++i) { l.push_back(i); lo.push_back(i); } assert(is_contiguous_container_asan_correct(l)); assert(is_contiguous_container_asan_correct(lo)); std::vector > l2 = std::move(l); assert(l2 == lo); assert(l.empty()); assert(l2.get_allocator() == lo.get_allocator()); assert(is_contiguous_container_asan_correct(l2)); } { int a1[] = {1, 3, 7, 9, 10}; std::vector> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); assert(is_contiguous_container_asan_correct(c1)); std::vector>::const_iterator i = c1.begin(); std::vector> c2 = std::move(c1); assert(is_contiguous_container_asan_correct(c2)); std::vector>::iterator j = c2.erase(i); assert(*j == 3); assert(is_contiguous_container_asan_correct(c2)); } { test_alloc_base::clear(); using Vect = std::vector >; Vect v(test_allocator(42, 101)); assert(test_alloc_base::count == 1); assert(test_alloc_base::copied == 1); assert(test_alloc_base::moved == 0); { const test_allocator& a = v.get_allocator(); assert(a.get_data() == 42); assert(a.get_id() == 101); } assert(test_alloc_base::count == 1); test_alloc_base::clear_ctor_counters(); Vect v2 = std::move(v); assert(test_alloc_base::count == 2); assert(test_alloc_base::copied == 0); assert(test_alloc_base::moved == 1); { const test_allocator& a = v.get_allocator(); assert(a.get_id() == test_alloc_base::moved_value); assert(a.get_data() == test_alloc_base::moved_value); } { const test_allocator& a = v2.get_allocator(); assert(a.get_id() == 101); assert(a.get_data() == 42); } } }