Home | History | Annotate | Download | only in deque.cons
      1 //===----------------------------------------------------------------------===//
      2 //
      3 //                     The LLVM Compiler Infrastructure
      4 //
      5 // This file is dual licensed under the MIT and the University of Illinois Open
      6 // Source Licenses. See LICENSE.TXT for details.
      7 //
      8 //===----------------------------------------------------------------------===//
      9 
     10 // <deque>
     11 
     12 // void assign(size_type n, const value_type& v);
     13 
     14 #include <deque>
     15 #include <cassert>
     16 
     17 #include "test_iterators.h"
     18 #include "min_allocator.h"
     19 
     20 template <class C>
     21 C
     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     }
     32     C c(init, 0);
     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 
     42 template <class C>
     43 void
     44 test(C& c1, int size, int v)
     45 {
     46     typedef typename C::const_iterator CI;
     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 
     55 template <class C>
     56 void
     57 testN(int start, int N, int M)
     58 {
     59     typedef typename C::iterator I;
     60     typedef typename C::const_iterator CI;
     61     C c1 = make<C>(N, start);
     62     test(c1, M, -10);
     63 }
     64 
     65 int main()
     66 {
     67     {
     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)
     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
     85 }
     86