63 lines
2.1 KiB
C++
63 lines
2.1 KiB
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
|
//
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
|||
|
|
//
|
|||
|
|
// This file is distributed under the University of Illinois Open Source
|
|||
|
|
// License. See LICENSE.TXT for details.
|
|||
|
|
//
|
|||
|
|
//===----------------------------------------------------------------------===//
|
|||
|
|
|
|||
|
|
// <list>
|
|||
|
|
|
|||
|
|
// list(list&& c, const allocator_type& a);
|
|||
|
|
|
|||
|
|
#include <list>
|
|||
|
|
#include <cassert>
|
|||
|
|
#include "../../../MoveOnly.h"
|
|||
|
|
#include "../../../test_allocator.h"
|
|||
|
|
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
#ifdef _LIBCPP_MOVE
|
|||
|
|
{
|
|||
|
|
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), test_allocator<MoveOnly>(6));
|
|||
|
|
assert(l2 == lo);
|
|||
|
|
assert(!l.empty());
|
|||
|
|
assert(l2.get_allocator() == test_allocator<MoveOnly>(6));
|
|||
|
|
}
|
|||
|
|
{
|
|||
|
|
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), test_allocator<MoveOnly>(5));
|
|||
|
|
assert(l2 == lo);
|
|||
|
|
assert(l.empty());
|
|||
|
|
assert(l2.get_allocator() == test_allocator<MoveOnly>(5));
|
|||
|
|
}
|
|||
|
|
{
|
|||
|
|
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), other_allocator<MoveOnly>(4));
|
|||
|
|
assert(l2 == lo);
|
|||
|
|
assert(!l.empty());
|
|||
|
|
assert(l2.get_allocator() == other_allocator<MoveOnly>(4));
|
|||
|
|
}
|
|||
|
|
#endif
|
|||
|
|
}
|