//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // vector(vector&& c); #include #include #include "../../../MoveOnly.h" #include "../../../test_allocator.h" int main() { #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES { std::vector > l(test_allocator(5)); std::vector > lo(test_allocator(5)); for (int i = 1; i <= 3; ++i) { l.push_back(i); lo.push_back(i); } std::vector > l2 = std::move(l); assert(l2 == lo); assert(l.empty()); assert(l2.get_allocator() == lo.get_allocator()); } { std::vector > l(other_allocator(5)); std::vector > lo(other_allocator(5)); for (int i = 1; i <= 3; ++i) { l.push_back(i); lo.push_back(i); } std::vector > l2 = std::move(l); assert(l2 == lo); assert(l.empty()); assert(l2.get_allocator() == lo.get_allocator()); } { int a1[] = {1, 3, 7, 9, 10}; std::vector c1(a1, a1+sizeof(a1)/sizeof(a1[0])); std::vector::const_iterator i = c1.begin(); std::vector c2 = std::move(c1); std::vector::iterator j = c2.erase(i); assert(*j == 3); } #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES }