//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // list(list&& c, const allocator_type& a); #include #include #include "../../../MoveOnly.h" #include "test_allocator.h" #include "min_allocator.h" int main() { #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES { std::list > l(test_allocator(5)); std::list > lo(test_allocator(5)); for (int i = 1; i <= 3; ++i) { l.push_back(i); lo.push_back(i); } std::list > l2(std::move(l), test_allocator(6)); assert(l2 == lo); assert(!l.empty()); assert(l2.get_allocator() == test_allocator(6)); } { std::list > l(test_allocator(5)); std::list > lo(test_allocator(5)); for (int i = 1; i <= 3; ++i) { l.push_back(i); lo.push_back(i); } std::list > l2(std::move(l), test_allocator(5)); assert(l2 == lo); assert(l.empty()); assert(l2.get_allocator() == test_allocator(5)); } { std::list > l(other_allocator(5)); std::list > lo(other_allocator(5)); for (int i = 1; i <= 3; ++i) { l.push_back(i); lo.push_back(i); } std::list > l2(std::move(l), other_allocator(4)); assert(l2 == lo); assert(!l.empty()); assert(l2.get_allocator() == other_allocator(4)); } #if __cplusplus >= 201103L { std::list > l(min_allocator{}); std::list > lo(min_allocator{}); for (int i = 1; i <= 3; ++i) { l.push_back(i); lo.push_back(i); } std::list > l2(std::move(l), min_allocator()); assert(l2 == lo); assert(l.empty()); assert(l2.get_allocator() == min_allocator()); } #endif #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES }