blob: 677963deeb8452775ac5a4ac54fd504a2dbe6783 [file] [log] [blame]
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00001//===----------------------------------------------------------------------===//
2//
Howard Hinnantf5256e12010-05-11 21:36:01 +00003// The LLVM Compiler Infrastructure
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00004//
Howard Hinnantb64f8b02010-11-16 22:09:02 +00005// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. See LICENSE.TXT for details.
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00007//
8//===----------------------------------------------------------------------===//
9
10// <vector>
11
12// vector(const vector& v);
13
14#include <vector>
15#include <cassert>
Marshall Clow1b921882013-12-03 00:18:10 +000016#include "test_allocator.h"
Marshall Clow061d0cc2013-11-26 20:58:02 +000017#include "min_allocator.h"
Marshall Clow1f50f2d2014-05-08 14:14:06 +000018#include "asan_testing.h"
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000019
20template <class C>
21void
22test(const C& x)
23{
24 unsigned s = x.size();
25 C c(x);
Dan Albert1d4a1ed2016-05-25 22:36:09 -070026 assert(c.__invariants());
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000027 assert(c.size() == s);
28 assert(c == x);
Dan Albert1d4a1ed2016-05-25 22:36:09 -070029 assert(is_contiguous_container_asan_correct(c));
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000030}
31
32int main()
33{
34 {
35 int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 1, 0};
36 int* an = a + sizeof(a)/sizeof(a[0]);
37 test(std::vector<int>(a, an));
38 }
39 {
40 std::vector<int, test_allocator<int> > v(3, 2, test_allocator<int>(5));
41 std::vector<int, test_allocator<int> > v2 = v;
Marshall Clow1f50f2d2014-05-08 14:14:06 +000042 assert(is_contiguous_container_asan_correct(v));
43 assert(is_contiguous_container_asan_correct(v2));
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000044 assert(v2 == v);
45 assert(v2.get_allocator() == v.get_allocator());
Marshall Clow1f50f2d2014-05-08 14:14:06 +000046 assert(is_contiguous_container_asan_correct(v));
47 assert(is_contiguous_container_asan_correct(v2));
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000048 }
Dan Albert1d4a1ed2016-05-25 22:36:09 -070049#ifndef _LIBCPP_HAS_NO_ADVANCED_SFINAE
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000050 {
51 std::vector<int, other_allocator<int> > v(3, 2, other_allocator<int>(5));
52 std::vector<int, other_allocator<int> > v2 = v;
Marshall Clow1f50f2d2014-05-08 14:14:06 +000053 assert(is_contiguous_container_asan_correct(v));
54 assert(is_contiguous_container_asan_correct(v2));
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000055 assert(v2 == v);
56 assert(v2.get_allocator() == other_allocator<int>(-2));
Marshall Clow1f50f2d2014-05-08 14:14:06 +000057 assert(is_contiguous_container_asan_correct(v));
58 assert(is_contiguous_container_asan_correct(v2));
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000059 }
Dan Albert1d4a1ed2016-05-25 22:36:09 -070060#endif // _LIBCPP_HAS_NO_ADVANCED_SFINAE
61#if __cplusplus >= 201103L
Howard Hinnant2c39cbe2013-06-27 19:35:32 +000062 {
63 int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 1, 0};
64 int* an = a + sizeof(a)/sizeof(a[0]);
65 test(std::vector<int, min_allocator<int>>(a, an));
66 }
67 {
68 std::vector<int, min_allocator<int> > v(3, 2, min_allocator<int>());
69 std::vector<int, min_allocator<int> > v2 = v;
Marshall Clow1f50f2d2014-05-08 14:14:06 +000070 assert(is_contiguous_container_asan_correct(v));
71 assert(is_contiguous_container_asan_correct(v2));
Howard Hinnant2c39cbe2013-06-27 19:35:32 +000072 assert(v2 == v);
73 assert(v2.get_allocator() == v.get_allocator());
Marshall Clow1f50f2d2014-05-08 14:14:06 +000074 assert(is_contiguous_container_asan_correct(v));
75 assert(is_contiguous_container_asan_correct(v2));
Howard Hinnant2c39cbe2013-06-27 19:35:32 +000076 }
77#endif
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000078}