| //===----------------------------------------------------------------------===// |
| // |
| // 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(list&& c); |
| |
| #include <list> |
| #include <cassert> |
| #include "../../../MoveOnly.h" |
| #include "../../../test_allocator.h" |
| #include "min_allocator.h" |
| |
| int main() |
| { |
| #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| { |
| std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5)); |
| std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); |
| for (int i = 1; i <= 3; ++i) |
| { |
| l.push_back(i); |
| lo.push_back(i); |
| } |
| std::list<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l); |
| assert(l2 == lo); |
| assert(l.empty()); |
| assert(l2.get_allocator() == lo.get_allocator()); |
| } |
| { |
| std::list<MoveOnly, other_allocator<MoveOnly> > l(other_allocator<MoveOnly>(5)); |
| std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); |
| for (int i = 1; i <= 3; ++i) |
| { |
| l.push_back(i); |
| lo.push_back(i); |
| } |
| std::list<MoveOnly, other_allocator<MoveOnly> > l2 = std::move(l); |
| assert(l2 == lo); |
| assert(l.empty()); |
| assert(l2.get_allocator() == lo.get_allocator()); |
| } |
| #if __cplusplus >= 201103L |
| { |
| std::list<MoveOnly, min_allocator<MoveOnly> > l(min_allocator<MoveOnly>{}); |
| std::list<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{}); |
| for (int i = 1; i <= 3; ++i) |
| { |
| l.push_back(i); |
| lo.push_back(i); |
| } |
| std::list<MoveOnly, min_allocator<MoveOnly> > l2 = std::move(l); |
| assert(l2 == lo); |
| assert(l.empty()); |
| assert(l2.get_allocator() == lo.get_allocator()); |
| } |
| #endif |
| #if _LIBCPP_DEBUG >= 1 |
| { |
| std::list<int> l1 = {1, 2, 3}; |
| std::list<int>::iterator i = l1.begin(); |
| std::list<int> l2 = std::move(l1); |
| assert(*l2.erase(i) == 2); |
| assert(l2.size() == 2); |
| } |
| #endif |
| #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| } |