1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
12 // iterator erase(const_iterator p)
20 #include "min_allocator.h"
24 make(int size, int start = 0 )
26 const int b = 4096 / sizeof(int);
30 init = (start+1) / b + ((start+1) % b != 0);
35 for (int i = 0; i < init-start; ++i)
37 for (int i = 0; i < size; ++i)
39 for (int i = 0; i < start; ++i)
48 typedef typename C::iterator I;
49 assert(static_cast<std::size_t>(P) < c1.size());
50 std::size_t c1_osize = c1.size();
51 I i = c1.erase(c1.cbegin() + P);
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize - 1);
54 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
57 for (; j < P; ++j, ++i)
59 for (++j; static_cast<std::size_t>(j) < c1_osize; ++j, ++i)
65 testN(int start, int N)
67 int pstep = std::max(N / std::max(std::min(N, 10), 1), 1);
68 for (int p = 0; p < N; p += pstep)
70 C c1 = make<C>(N, start);
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
79 const int N = sizeof(rng)/sizeof(rng[0]);
80 for (int i = 0; i < N; ++i)
81 for (int j = 0; j < N; ++j)
82 testN<std::deque<int> >(rng[i], rng[j]);
84 #if TEST_STD_VER >= 11
86 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
87 const int N = sizeof(rng)/sizeof(rng[0]);
88 for (int i = 0; i < N; ++i)
89 for (int j = 0; j < N; ++j)
90 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);