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 // void pop_front()
13
14 #include <deque>
15 #include <cassert>
16 #include <cstddef>
17
18 #include "min_allocator.h"
19
20 template <class C>
21 C
make(int size,int start=0)22 make(int size, int start = 0 )
23 {
24 const int b = 4096 / sizeof(int);
25 int init = 0;
26 if (start > 0)
27 {
28 init = (start+1) / b + ((start+1) % b != 0);
29 init *= b;
30 --init;
31 }
32 C c(init, 0);
33 for (int i = 0; i < init-start; ++i)
34 c.pop_back();
35 for (int i = 0; i < size; ++i)
36 c.push_back(i);
37 for (int i = 0; i < start; ++i)
38 c.pop_front();
39 return c;
40 }
41
42 template <class C>
43 void
test(C & c1)44 test(C& c1)
45 {
46 typedef typename C::iterator I;
47 std::size_t c1_osize = c1.size();
48 c1.pop_front();
49 assert(c1.size() == c1_osize - 1);
50 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
51 I i = c1.begin();
52 for (int j = 1; static_cast<std::size_t>(j) < c1.size(); ++j, ++i)
53 assert(*i == j);
54 }
55
56 template <class C>
57 void
testN(int start,int N)58 testN(int start, int N)
59 {
60 if (N != 0)
61 {
62 C c1 = make<C>(N, start);
63 test(c1);
64 }
65 }
66
main()67 int main()
68 {
69 {
70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
71 const int N = sizeof(rng)/sizeof(rng[0]);
72 for (int i = 0; i < N; ++i)
73 for (int j = 0; j < N; ++j)
74 testN<std::deque<int> >(rng[i], rng[j]);
75 }
76 #if TEST_STD_VER >= 11
77 {
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
79 const int N = sizeof(rng)/sizeof(rng[0]);
80 for (int i = 0; i < N; ++i)
81 for (int j = 0; j < N; ++j)
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
83 }
84 #endif
85 }
86