push_back_rvalue.pass.cpp revision f5256e16dfc425c1d466f6308d4026d529ce9e0b
1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant// The LLVM Compiler Infrastructure 4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 5bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// This file is distributed under the University of Illinois Open Source 6bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// License. See LICENSE.TXT for details. 7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <deque> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// void push_back(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 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include "../../../MoveOnly.h" 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#ifdef _LIBCPP_MOVE 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantstd::deque<MoveOnly> 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 } 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::deque<MoveOnly> 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 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 { 50bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::deque<MoveOnly> c = make(size, rng[j]); 51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::deque<MoveOnly>::const_iterator it = c.begin(); 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < size; ++i, ++it) 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*it == MoveOnly(i)); 54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 55bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#endif 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 59bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 60bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 61bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#ifdef _LIBCPP_MOVE 62bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; 63bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 64bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = 0; j < N; ++j) 65bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(rng[j]); 66bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#endif 67bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 68