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