df00d5e5ad
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@227370 91177308-0d34-0410-b5e6-96231b3b80d8
104 lines
3.9 KiB
C++
104 lines
3.9 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <vector>
|
|
|
|
// vector(vector&& c);
|
|
|
|
#include <vector>
|
|
#include <cassert>
|
|
#include "MoveOnly.h"
|
|
#include "test_allocator.h"
|
|
#include "min_allocator.h"
|
|
#include "asan_testing.h"
|
|
|
|
int main()
|
|
{
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
std::vector<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5));
|
|
std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
|
|
assert(is_contiguous_container_asan_correct(l));
|
|
assert(is_contiguous_container_asan_correct(lo));
|
|
for (int i = 1; i <= 3; ++i)
|
|
{
|
|
l.push_back(i);
|
|
lo.push_back(i);
|
|
}
|
|
assert(is_contiguous_container_asan_correct(l));
|
|
assert(is_contiguous_container_asan_correct(lo));
|
|
std::vector<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l);
|
|
assert(l2 == lo);
|
|
assert(l.empty());
|
|
assert(l2.get_allocator() == lo.get_allocator());
|
|
assert(is_contiguous_container_asan_correct(l2));
|
|
}
|
|
{
|
|
std::vector<MoveOnly, other_allocator<MoveOnly> > l(other_allocator<MoveOnly>(5));
|
|
std::vector<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5));
|
|
assert(is_contiguous_container_asan_correct(l));
|
|
assert(is_contiguous_container_asan_correct(lo));
|
|
for (int i = 1; i <= 3; ++i)
|
|
{
|
|
l.push_back(i);
|
|
lo.push_back(i);
|
|
}
|
|
assert(is_contiguous_container_asan_correct(l));
|
|
assert(is_contiguous_container_asan_correct(lo));
|
|
std::vector<MoveOnly, other_allocator<MoveOnly> > l2 = std::move(l);
|
|
assert(l2 == lo);
|
|
assert(l.empty());
|
|
assert(l2.get_allocator() == lo.get_allocator());
|
|
assert(is_contiguous_container_asan_correct(l2));
|
|
}
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
std::vector<int>::const_iterator i = c1.begin();
|
|
std::vector<int> c2 = std::move(c1);
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
std::vector<int>::iterator j = c2.erase(i);
|
|
assert(*j == 3);
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
std::vector<MoveOnly, min_allocator<MoveOnly> > l(min_allocator<MoveOnly>{});
|
|
std::vector<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{});
|
|
assert(is_contiguous_container_asan_correct(l));
|
|
assert(is_contiguous_container_asan_correct(lo));
|
|
for (int i = 1; i <= 3; ++i)
|
|
{
|
|
l.push_back(i);
|
|
lo.push_back(i);
|
|
}
|
|
assert(is_contiguous_container_asan_correct(l));
|
|
assert(is_contiguous_container_asan_correct(lo));
|
|
std::vector<MoveOnly, min_allocator<MoveOnly> > l2 = std::move(l);
|
|
assert(l2 == lo);
|
|
assert(l.empty());
|
|
assert(l2.get_allocator() == lo.get_allocator());
|
|
assert(is_contiguous_container_asan_correct(l2));
|
|
}
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
std::vector<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
std::vector<int, min_allocator<int>>::const_iterator i = c1.begin();
|
|
std::vector<int, min_allocator<int>> c2 = std::move(c1);
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
std::vector<int, min_allocator<int>>::iterator j = c2.erase(i);
|
|
assert(*j == 3);
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
#endif
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
}
|