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_back()
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(C & c1)43 test(C& c1)
44 {
45 typedef typename C::iterator I;
46 std::size_t c1_osize = c1.size();
47 c1.pop_back();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 0; j < c1.size(); ++j, ++i)
52 assert(*i == j);
53 }
54
55 template <class C>
56 void
testN(int start,int N)57 testN(int start, int N)
58 {
59 if (N != 0)
60 {
61 C c1 = make<C>(N, start);
62 test(c1);
63 }
64 }
65
main()66 int main()
67 {
68 {
69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
70 const int N = sizeof(rng)/sizeof(rng[0]);
71 for (int i = 0; i < N; ++i)
72 for (int j = 0; j < N; ++j)
73 testN<std::deque<int> >(rng[i], rng[j]);
74 }
75 #if __cplusplus >= 201103L
76 {
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
78 const int N = sizeof(rng)/sizeof(rng[0]);
79 for (int i = 0; i < N; ++i)
80 for (int j = 0; j < N; ++j)
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
82 }
83 #endif
84 }
85