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