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 shrink_to_fit(); 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) 44 { 45 C s = c1; 46 c1.shrink_to_fit(); 47 assert(c1 == s); 48 } 49 50 template <class C> 51 void 52 testN(int start, int N) 53 { 54 typedef typename C::const_iterator CI; 55 C c1 = make<C>(N, start); 56 test(c1); 57 } 58 59 int main() 60 { 61 { 62 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 63 const int N = sizeof(rng)/sizeof(rng[0]); 64 for (int i = 0; i < N; ++i) 65 for (int j = 0; j < N; ++j) 66 testN<std::deque<int> >(rng[i], rng[j]); 67 } 68 #if __cplusplus >= 201103L 69 { 70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 71 const int N = sizeof(rng)/sizeof(rng[0]); 72 for (int i = 0; i < N; ++i) 73 for (int j = 0; j < N; ++j) 74 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); 75 } 76 #endif 77 } 78
