1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
12 // iterator insert(const_iterator position, const value_type& x);
14 #if _LIBCPP_DEBUG >= 1
15 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
20 #include "../../../stack_allocator.h"
21 #include "min_allocator.h"
22 #include "asan_testing.h"
27 std::vector<int> v(100);
28 std::vector<int>::iterator i = v.insert(v.cbegin() + 10, 1);
29 assert(v.size() == 101);
30 assert(is_contiguous_container_asan_correct(v));
31 assert(i == v.begin() + 10);
33 for (j = 0; j < 10; ++j)
36 for (++j; j < 101; ++j)
40 std::vector<int, stack_allocator<int, 300> > v(100);
41 std::vector<int, stack_allocator<int, 300> >::iterator i = v.insert(v.cbegin() + 10, 1);
42 assert(v.size() == 101);
43 assert(is_contiguous_container_asan_correct(v));
44 assert(i == v.begin() + 10);
46 for (j = 0; j < 10; ++j)
49 for (++j; j < 101; ++j)
52 #if _LIBCPP_DEBUG >= 1
54 std::vector<int> v1(3);
55 std::vector<int> v2(3);
57 v1.insert(v2.begin(), i);
61 #if __cplusplus >= 201103L
63 std::vector<int, min_allocator<int>> v(100);
64 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, 1);
65 assert(v.size() == 101);
66 assert(is_contiguous_container_asan_correct(v));
67 assert(i == v.begin() + 10);
69 for (j = 0; j < 10; ++j)
72 for (++j; j < 101; ++j)
75 #if _LIBCPP_DEBUG >= 1
77 std::vector<int, min_allocator<int>> v1(3);
78 std::vector<int, min_allocator<int>> v2(3);
80 v1.insert(v2.begin(), i);