1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 // 10 // REQUIRES: long_tests 11 12 // <deque> 13 14 // iterator insert (const_iterator p, size_type n, const value_type& v); 15 16 #include <deque> 17 #include <cassert> 18 19 #include "min_allocator.h" 20 21 template <class C> 22 C 23 make(int size, int start = 0 ) 24 { 25 const int b = 4096 / sizeof(int); 26 int init = 0; 27 if (start > 0) 28 { 29 init = (start+1) / b + ((start+1) % b != 0); 30 init *= b; 31 --init; 32 } 33 C c(init, 0); 34 for (int i = 0; i < init-start; ++i) 35 c.pop_back(); 36 for (int i = 0; i < size; ++i) 37 c.push_back(i); 38 for (int i = 0; i < start; ++i) 39 c.pop_front(); 40 return c; 41 } 42 43 template <class C> 44 void 45 test(int P, C& c1, int size, int x) 46 { 47 typedef typename C::iterator I; 48 typedef typename C::const_iterator CI; 49 std::size_t c1_osize = c1.size(); 50 CI i = c1.insert(c1.begin() + P, size, x); 51 assert(i == c1.begin() + P); 52 assert(c1.size() == c1_osize + size); 53 assert(distance(c1.begin(), c1.end()) == c1.size()); 54 i = c1.begin(); 55 for (int j = 0; j < P; ++j, ++i) 56 assert(*i == j); 57 for (int j = 0; j < size; ++j, ++i) 58 assert(*i == x); 59 for (int j = P; j < c1_osize; ++j, ++i) 60 assert(*i == j); 61 } 62 63 template <class C> 64 void 65 testN(int start, int N, int M) 66 { 67 typedef typename C::iterator I; 68 typedef typename C::const_iterator CI; 69 for (int i = 0; i <= 3; ++i) 70 { 71 if (0 <= i && i <= N) 72 { 73 C c1 = make<C>(N, start); 74 test(i, c1, M, -10); 75 } 76 } 77 for (int i = M-1; i <= M+1; ++i) 78 { 79 if (0 <= i && i <= N) 80 { 81 C c1 = make<C>(N, start); 82 test(i, c1, M, -10); 83 } 84 } 85 for (int i = N/2-1; i <= N/2+1; ++i) 86 { 87 if (0 <= i && i <= N) 88 { 89 C c1 = make<C>(N, start); 90 test(i, c1, M, -10); 91 } 92 } 93 for (int i = N - M - 1; i <= N - M + 1; ++i) 94 { 95 if (0 <= i && i <= N) 96 { 97 C c1 = make<C>(N, start); 98 test(i, c1, M, -10); 99 } 100 } 101 for (int i = N - 3; i <= N; ++i) 102 { 103 if (0 <= i && i <= N) 104 { 105 C c1 = make<C>(N, start); 106 test(i, c1, M, -10); 107 } 108 } 109 } 110 111 template <class C> 112 void 113 self_reference_test() 114 { 115 typedef typename C::const_iterator CI; 116 for (int i = 0; i < 20; ++i) 117 { 118 for (int j = 0; j < 20; ++j) 119 { 120 C c = make<C>(20); 121 CI it = c.cbegin() + i; 122 CI jt = c.cbegin() + j; 123 c.insert(it, 5, *jt); 124 assert(c.size() == 25); 125 assert(distance(c.begin(), c.end()) == c.size()); 126 it = c.cbegin(); 127 for (int k = 0; k < i; ++k, ++it) 128 assert(*it == k); 129 for (int k = 0; k < 5; ++k, ++it) 130 assert(*it == j); 131 for (int k = i; k < 20; ++k, ++it) 132 assert(*it == k); 133 } 134 } 135 } 136 137 int main() 138 { 139 { 140 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 141 const int N = sizeof(rng)/sizeof(rng[0]); 142 for (int i = 0; i < N; ++i) 143 for (int j = 0; j < N; ++j) 144 for (int k = 0; k < N; ++k) 145 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 146 self_reference_test<std::deque<int> >(); 147 } 148 #if __cplusplus >= 201103L 149 { 150 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 151 const int N = sizeof(rng)/sizeof(rng[0]); 152 for (int i = 0; i < N; ++i) 153 for (int j = 0; j < N; ++j) 154 for (int k = 0; k < N; ++k) 155 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); 156 self_reference_test<std::deque<int, min_allocator<int>> >(); 157 } 158 #endif 159 } 160
