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// Optimization for deque::iterators 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// template <class InputIterator, class OutputIterator> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// OutputIterator 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// copy(InputIterator first, InputIterator last, OutputIterator result); 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <deque> 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 2183e2c4d877fe2d7793868b1c6a5d9525a7c4d431Marshall Clow#include "test_iterators.h" 22061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 24fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 25fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard HinnantC 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantmake(int size, int start = 0 ) 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int b = 4096 / sizeof(int); 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int init = 0; 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant if (start > 0) 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init = (start+1) / b + ((start+1) % b != 0); 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init *= b; 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant --init; 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 36fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c(init, 0); 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < init-start; ++i) 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_back(); 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < size; ++i) 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.push_back(i); 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < start; ++i) 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_front(); 43bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant return c; 44bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}; 45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 46fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid testN(int start, int N) 48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 49fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant typedef typename C::iterator I; 50fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant typedef typename C::const_iterator CI; 51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef random_access_iterator<I> RAI; 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef random_access_iterator<CI> RACI; 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef input_iterator<CI> ICI; 54fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c1 = make<C>(N, start); 55fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c2 = make<C>(N); 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end()); 57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1 == c2); 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end()); 59bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1 == c2); 60bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 61bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1 == c2); 62bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); 63bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1 == c2); 64bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(std::copy(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end()); 65bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1 == c2); 66bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(std::copy(ICI(c2.cbegin()), ICI(c2.cend()), c1.begin()) == c1.end()); 67bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1 == c2); 68bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 69bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 70bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 71bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 72fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant { 73fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 74fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 75fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant for (int i = 0; i < N; ++i) 76fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant for (int j = 0; j < N; ++j) 77fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant testN<std::deque<int> >(rng[i], rng[j]); 78fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant } 79fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#if __cplusplus >= 201103L 80fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant { 81bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 82bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 83bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < N; ++i) 84bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = 0; j < N; ++j) 85fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); 86fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant } 87fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#endif 88bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 89