39213641f4
unordered_set, however it is not complete yet for unordered_multiset, unordered_map or unordered_multimap. There has been a lot of work done for these other three containers, however that work was done just to keep all of the tests passing. You can try this out with -D_LIBCPP_DEBUG2. You will have to link to a libc++.dylib that has been compiled with src/debug.cpp. So far, vector (but not vector<bool>), list, and unordered_set are treated. I hope to get the other three unordered containers up fairly quickly now that unordered_set is done. The flag _LIBCPP_DEBUG2 will eventually be changed to _LIBCPP_DEBUG, but not today. This is my second effort at getting debug mode going for libc++, and I'm not quite yet ready to throw all of the work under the first attempt away. The basic design is that all of the debug information is kept in a central database, instead of in the containers. This has been done as an attempt to have debug mode and non-debug mode be ABI compatible with each other. There are some circumstances where if you construct a container in an environment without debug mode and pass it into debug mode, the checking will get confused and let you know with a readable error message. Passing containers the other way: from debug mode out to a non-debugging mode container should be 100% safe (at least that is the goal). git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@186991 91177308-0d34-0410-b5e6-96231b3b80d8
75 lines
2.3 KiB
C++
75 lines
2.3 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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_DEBUG2 >= 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
|
|
}
|