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 #include <cstddef> 17 18 #include "min_allocator.h" 19 20 template <class C> 21 C 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 44 test(C& c1, int x) 45 { 46 typedef typename C::iterator I; 47 std::size_t c1_osize = c1.size(); 48 c1.push_front(x); 49 assert(c1.size() == c1_osize + 1); 50 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size()); 51 I i = c1.begin(); 52 assert(*i == x); 53 ++i; 54 for (int j = 0; static_cast<std::size_t>(j) < c1_osize; ++j, ++i) 55 assert(*i == j); 56 } 57 58 template <class C> 59 void 60 testN(int start, int N) 61 { 62 C c1 = make<C>(N, start); 63 test(c1, -10); 64 } 65 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 TEST_STD_VER >= 11 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
