assign_size_value.pass.cpp revision 83e2c4d877fe2d7793868b1c6a5d9525a7c4d431
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 assign(size_type n, const value_type& v); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <deque> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 1783e2c4d877fe2d7793868b1c6a5d9525a7c4d431Marshall Clow#include "test_iterators.h" 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantstd::deque<int> 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantmake(int size, int start = 0 ) 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int b = 4096 / sizeof(int); 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int init = 0; 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant if (start > 0) 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init = (start+1) / b + ((start+1) % b != 0); 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant init *= b; 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant --init; 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::deque<int> c(init, 0); 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < init-start; ++i) 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_back(); 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < size; ++i) 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.push_back(i); 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < start; ++i) 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c.pop_front(); 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant return c; 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}; 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttest(std::deque<int>& c1, int size, int v) 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 43bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::deque<int> C; 44bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef C::const_iterator CI; 45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::size_t c1_osize = c1.size(); 46bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c1.assign(size, v); 47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1.size() == size); 48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(distance(c1.begin(), c1.end()) == c1.size()); 49bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (CI i = c1.begin(); i != c1.end(); ++i) 50bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(*i == v); 51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid 54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard HinnanttestN(int start, int N, int M) 55bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::deque<int> C; 57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef C::iterator I; 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef C::const_iterator CI; 59bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C c1 = make(N, start); 60bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(c1, M, -10); 61bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 62bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 63bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 64bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 65bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; 66bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const int N = sizeof(rng)/sizeof(rng[0]); 67bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < N; ++i) 68bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int j = 0; j < N; ++j) 69bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int k = 0; k < N; ++k) 70bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant testN(rng[i], rng[j], rng[k]); 71bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 72