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 resize(size_type n);
13
14 #include <deque>
15 #include <cassert>
16
17 #include "test_macros.h"
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,int size)44 test(C& c1, int size)
45 {
46 typedef typename C::const_iterator CI;
47 typename C::size_type c1_osize = c1.size();
48 c1.resize(size);
49 assert(c1.size() == size);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 CI i = c1.begin();
52 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 assert(*i == j);
54 for (int j = c1_osize; j < c1.size(); ++j, ++i)
55 assert(*i == 0);
56 }
57
58 template <class C>
59 void
testN(int start,int N,int M)60 testN(int start, int N, int M)
61 {
62 C c1 = make<C>(N, start);
63 test(c1, M);
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 for (int k = 0; k < N; ++k)
74 testN<std::deque<int> >(rng[i], rng[j], rng[k]);
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 for (int k = 0; k < N; ++k)
83 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]);
84 }
85 #endif
86 }
87