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