1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 
9 // <deque>
10 
11 //       reference operator[](size_type __i);
12 // const_reference operator[](size_type __i) const;
13 //
14 //       reference at(size_type __i);
15 // const_reference at(size_type __i) const;
16 //
17 //       reference front();
18 // const_reference front() const;
19 //
20 //       reference back();
21 // const_reference back() const;
22 
23 #include <deque>
24 #include <cassert>
25 
26 #include "min_allocator.h"
27 
28 template <class C>
29 C
30 make(int size, int start = 0 )
31 {
32     const int b = 4096 / sizeof(int);
33     int init = 0;
34     if (start > 0)
35     {
36         init = (start+1) / b + ((start+1) % b != 0);
37         init *= b;
38         --init;
39     }
40     C c(init, 0);
41     for (int i = 0; i < init-start; ++i)
42         c.pop_back();
43     for (int i = 0; i < size; ++i)
44         c.push_back(i);
45     for (int i = 0; i < start; ++i)
46         c.pop_front();
47     return c;
48 }
49 
50 int main(int, char**)
51 {
52     {
53         std::deque<int> c = make<std::deque<int> >(10);
54         for (int i = 0; i < 10; ++i)
55             assert(c[i] == i);
56         for (int i = 0; i < 10; ++i)
57             assert(c.at(i) == i);
58         assert(c.front() == 0);
59         assert(c.back() == 9);
60     }
61     {
62         const std::deque<int> c = make<std::deque<int> >(10);
63         for (int i = 0; i < 10; ++i)
64             assert(c[i] == i);
65         for (int i = 0; i < 10; ++i)
66             assert(c.at(i) == i);
67         assert(c.front() == 0);
68         assert(c.back() == 9);
69     }
70 #if TEST_STD_VER >= 11
71     {
72         std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10);
73         for (int i = 0; i < 10; ++i)
74             assert(c[i] == i);
75         for (int i = 0; i < 10; ++i)
76             assert(c.at(i) == i);
77         assert(c.front() == 0);
78         assert(c.back() == 9);
79     }
80     {
81         const std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10);
82         for (int i = 0; i < 10; ++i)
83             assert(c[i] == i);
84         for (int i = 0; i < 10; ++i)
85             assert(c.at(i) == i);
86         assert(c.front() == 0);
87         assert(c.back() == 9);
88     }
89 #endif
90 
91   return 0;
92 }
93