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// iterator insert (const_iterator p, value_type&& v); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <deque> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include "../../../MoveOnly.h" 18061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 2073d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 22fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 23fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard HinnantC 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantmake(int size, int start = 0 ) 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int b = 4096 / sizeof(int); 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int init = 0; 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant if (start > 0) 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init = (start+1) / b + ((start+1) % b != 0); 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init *= b; 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant --init; 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 34fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c(init); 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < init-start; ++i) 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_back(); 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < size; ++i) 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.push_back(MoveOnly(i)); 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < start; ++i) 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_front(); 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant return c; 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}; 43bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 44fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid 46fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttest(int P, C& c1, int x) 47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 48fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant typedef typename C::iterator I; 49fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant typedef typename C::const_iterator CI; 50bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::size_t c1_osize = c1.size(); 51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant CI i = c1.insert(c1.begin() + P, MoveOnly(x)); 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(i == c1.begin() + P); 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1.size() == c1_osize + 1); 54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(distance(c1.begin(), c1.end()) == c1.size()); 55bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant i = c1.begin(); 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = 0; j < P; ++j, ++i) 57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*i == MoveOnly(j)); 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*i == MoveOnly(x)); 59bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant ++i; 60bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = P; j < c1_osize; ++j, ++i) 61bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*i == MoveOnly(j)); 62bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 63bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 64fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnanttemplate <class C> 65bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid 66bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard HinnanttestN(int start, int N) 67bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 68fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant typedef typename C::iterator I; 69fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant typedef typename C::const_iterator CI; 70bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i <= 3; ++i) 71bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 72bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant if (0 <= i && i <= N) 73bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 74fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c1 = make<C>(N, start); 75bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(i, c1, -10); 76bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 77bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 78bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = N/2-1; i <= N/2+1; ++i) 79bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 80bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant if (0 <= i && i <= N) 81bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 82fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c1 = make<C>(N, start); 83bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(i, c1, -10); 84bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 85bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 86bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = N - 3; i <= N; ++i) 87bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 88bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant if (0 <= i && i <= N) 89bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 90fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant C c1 = make<C>(N, start); 91bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(i, c1, -10); 92bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 93bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 94bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 95bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 9673d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 97bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 98bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 99bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 10073d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 101fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant { 102fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 103fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 104fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant for (int i = 0; i < N; ++i) 105fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant for (int j = 0; j < N; ++j) 106fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant testN<std::deque<MoveOnly> >(rng[i], rng[j]); 107fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant } 108fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#if __cplusplus >= 201103L 109fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant { 110bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 111bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 112bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < N; ++i) 113bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = 0; j < N; ++j) 114fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]); 115fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant } 116fcd8db7133c56a5a627f3922ce4a180c12287dd9Howard Hinnant#endif 11773d21a4f0774d3fadab98e690619a359cfb160a3Howard Hinnant#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 118bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 119