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 resize(size_type n, const value_type& v); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <deque> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 17061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 18fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant 19fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 20fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard HinnantC 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantmake(int size, int start = 0 ) 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int b = 4096 / sizeof(int); 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int init = 0; 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant if (start > 0) 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init = (start+1) / b + ((start+1) % b != 0); 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init *= b; 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant --init; 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 31fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c(init, 0); 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < init-start; ++i) 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_back(); 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < size; ++i) 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.push_back(i); 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < start; ++i) 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_front(); 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant return c; 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}; 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 41fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid 43fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttest(C& c1, int size, int x) 44bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 45fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant typedef typename C::const_iterator CI; 46bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::size_t c1_osize = c1.size(); 47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c1.resize(size, x); 48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1.size() == size); 49bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(distance(c1.begin(), c1.end()) == c1.size()); 50bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant CI i = c1.begin(); 51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i) 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*i == j); 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = c1_osize; j < c1.size(); ++j, ++i) 54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*i == x); 55bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 57fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid 59bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard HinnanttestN(int start, int N, int M) 60bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 61fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant typedef typename C::const_iterator CI; 62fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c1 = make<C>(N, start); 63bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(c1, M, -10); 64bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 65bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 66bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 67bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 68fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant { 69fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 70fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 71fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant for (int i = 0; i < N; ++i) 72fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant for (int j = 0; j < N; ++j) 73fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant for (int k = 0; k < N; ++k) 74fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant testN<std::deque<int> >(rng[i], rng[j], rng[k]); 75fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant } 76fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#if __cplusplus >= 201103L 77fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant { 78bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 79bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 80bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < N; ++i) 81bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = 0; j < N; ++j) 82bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int k = 0; k < N; ++k) 83fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]); 84fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant } 85fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#endif 86bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 87