a90c6dd460
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@224658 91177308-0d34-0410-b5e6-96231b3b80d8
79 lines
2.6 KiB
C++
79 lines
2.6 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(const vector& v);
|
|
|
|
#include <vector>
|
|
#include <cassert>
|
|
#include "test_allocator.h"
|
|
#include "min_allocator.h"
|
|
#include "asan_testing.h"
|
|
|
|
template <class C>
|
|
void
|
|
test(const C& x)
|
|
{
|
|
unsigned s = x.size();
|
|
C c(x);
|
|
assert(c.__invariants());
|
|
assert(c.size() == s);
|
|
assert(c == x);
|
|
assert(is_contiguous_container_asan_correct(c));
|
|
}
|
|
|
|
int main()
|
|
{
|
|
{
|
|
int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 1, 0};
|
|
int* an = a + sizeof(a)/sizeof(a[0]);
|
|
test(std::vector<int>(a, an));
|
|
}
|
|
{
|
|
std::vector<int, test_allocator<int> > v(3, 2, test_allocator<int>(5));
|
|
std::vector<int, test_allocator<int> > v2 = v;
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
assert(is_contiguous_container_asan_correct(v2));
|
|
assert(v2 == v);
|
|
assert(v2.get_allocator() == v.get_allocator());
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
assert(is_contiguous_container_asan_correct(v2));
|
|
}
|
|
#ifndef _LIBCPP_HAS_NO_ADVANCED_SFINAE
|
|
{
|
|
std::vector<int, other_allocator<int> > v(3, 2, other_allocator<int>(5));
|
|
std::vector<int, other_allocator<int> > v2 = v;
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
assert(is_contiguous_container_asan_correct(v2));
|
|
assert(v2 == v);
|
|
assert(v2.get_allocator() == other_allocator<int>(-2));
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
assert(is_contiguous_container_asan_correct(v2));
|
|
}
|
|
#endif // _LIBCPP_HAS_NO_ADVANCED_SFINAE
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 1, 0};
|
|
int* an = a + sizeof(a)/sizeof(a[0]);
|
|
test(std::vector<int, min_allocator<int>>(a, an));
|
|
}
|
|
{
|
|
std::vector<int, min_allocator<int> > v(3, 2, min_allocator<int>());
|
|
std::vector<int, min_allocator<int> > v2 = v;
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
assert(is_contiguous_container_asan_correct(v2));
|
|
assert(v2 == v);
|
|
assert(v2.get_allocator() == v.get_allocator());
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
assert(is_contiguous_container_asan_correct(v2));
|
|
}
|
|
#endif
|
|
}
|