1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant// The LLVM Compiler Infrastructure 4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details. 7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <deque> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// void push_back(const value_type& v); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// void pop_back(); 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// void pop_front(); 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <deque> 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 19061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 20fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant 21fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 22fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard HinnantC 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantmake(int size, int start = 0 ) 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int b = 4096 / sizeof(int); 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int init = 0; 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant if (start > 0) 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init = (start+1) / b + ((start+1) % b != 0); 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init *= b; 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant --init; 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 33fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c(init, 0); 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < init-start; ++i) 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_back(); 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < size; ++i) 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.push_back(i); 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < start; ++i) 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_front(); 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant return c; 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}; 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 43fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 44bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid test(int size) 45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 46bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; 47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = 0; j < N; ++j) 49bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 50fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c = make<C>(size, rng[j]); 51fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant typename C::const_iterator it = c.begin(); 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < size; ++i, ++it) 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*it == i); 54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 55bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 59fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant { 60fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; 61fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 62fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant for (int j = 0; j < N; ++j) 63fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant test<std::deque<int> >(rng[j]); 64fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant } 65fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#if __cplusplus >= 201103L 66fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant { 67bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; 68bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 69bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = 0; j < N; ++j) 70fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant test<std::deque<int, min_allocator<int>> >(rng[j]); 71fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant } 72fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#endif 73bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 74