Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 4 | // |
Howard Hinnant | b64f8b0 | 2010-11-16 22:09:02 +0000 | [diff] [blame] | 5 | // This file is dual licensed under the MIT and the University of Illinois Open |
| 6 | // Source Licenses. See LICENSE.TXT for details. |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | // <deque> |
| 11 | |
| 12 | // void assign(size_type n, const value_type& v); |
| 13 | |
| 14 | #include <deque> |
| 15 | #include <cassert> |
| 16 | |
Marshall Clow | 83e2c4d | 2013-01-05 03:21:01 +0000 | [diff] [blame] | 17 | #include "test_iterators.h" |
Marshall Clow | 061d0cc | 2013-11-26 20:58:02 +0000 | [diff] [blame^] | 18 | #include "min_allocator.h" |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 19 | |
Howard Hinnant | fcd8db7 | 2013-06-23 21:17:24 +0000 | [diff] [blame] | 20 | template <class C> |
| 21 | C |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 22 | make(int size, int start = 0 ) |
| 23 | { |
| 24 | const int b = 4096 / sizeof(int); |
| 25 | int init = 0; |
| 26 | if (start > 0) |
| 27 | { |
| 28 | init = (start+1) / b + ((start+1) % b != 0); |
| 29 | init *= b; |
| 30 | --init; |
| 31 | } |
Howard Hinnant | fcd8db7 | 2013-06-23 21:17:24 +0000 | [diff] [blame] | 32 | C c(init, 0); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 33 | for (int i = 0; i < init-start; ++i) |
| 34 | c.pop_back(); |
| 35 | for (int i = 0; i < size; ++i) |
| 36 | c.push_back(i); |
| 37 | for (int i = 0; i < start; ++i) |
| 38 | c.pop_front(); |
| 39 | return c; |
| 40 | }; |
| 41 | |
Howard Hinnant | fcd8db7 | 2013-06-23 21:17:24 +0000 | [diff] [blame] | 42 | template <class C> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 43 | void |
Howard Hinnant | fcd8db7 | 2013-06-23 21:17:24 +0000 | [diff] [blame] | 44 | test(C& c1, int size, int v) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 45 | { |
Howard Hinnant | fcd8db7 | 2013-06-23 21:17:24 +0000 | [diff] [blame] | 46 | typedef typename C::const_iterator CI; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 47 | std::size_t c1_osize = c1.size(); |
| 48 | c1.assign(size, v); |
| 49 | assert(c1.size() == size); |
| 50 | assert(distance(c1.begin(), c1.end()) == c1.size()); |
| 51 | for (CI i = c1.begin(); i != c1.end(); ++i) |
| 52 | assert(*i == v); |
| 53 | } |
| 54 | |
Howard Hinnant | fcd8db7 | 2013-06-23 21:17:24 +0000 | [diff] [blame] | 55 | template <class C> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 56 | void |
| 57 | testN(int start, int N, int M) |
| 58 | { |
Howard Hinnant | fcd8db7 | 2013-06-23 21:17:24 +0000 | [diff] [blame] | 59 | typedef typename C::iterator I; |
| 60 | typedef typename C::const_iterator CI; |
| 61 | C c1 = make<C>(N, start); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 62 | test(c1, M, -10); |
| 63 | } |
| 64 | |
| 65 | int main() |
| 66 | { |
Howard Hinnant | fcd8db7 | 2013-06-23 21:17:24 +0000 | [diff] [blame] | 67 | { |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 68 | int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; |
| 69 | const int N = sizeof(rng)/sizeof(rng[0]); |
| 70 | for (int i = 0; i < N; ++i) |
| 71 | for (int j = 0; j < N; ++j) |
| 72 | for (int k = 0; k < N; ++k) |
Howard Hinnant | fcd8db7 | 2013-06-23 21:17:24 +0000 | [diff] [blame] | 73 | testN<std::deque<int> >(rng[i], rng[j], rng[k]); |
| 74 | } |
| 75 | #if __cplusplus >= 201103L |
| 76 | { |
| 77 | int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; |
| 78 | const int N = sizeof(rng)/sizeof(rng[0]); |
| 79 | for (int i = 0; i < N; ++i) |
| 80 | for (int j = 0; j < N; ++j) |
| 81 | for (int k = 0; k < N; ++k) |
| 82 | testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); |
| 83 | } |
| 84 | #endif |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 85 | } |