91 lines
2.1 KiB
C++
91 lines
2.1 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <deque>
|
|
|
|
// iterator erase(const_iterator p)
|
|
|
|
#include <deque>
|
|
#include <cassert>
|
|
|
|
#include "min_allocator.h"
|
|
|
|
template <class C>
|
|
C
|
|
make(int size, int start = 0 )
|
|
{
|
|
const int b = 4096 / sizeof(int);
|
|
int init = 0;
|
|
if (start > 0)
|
|
{
|
|
init = (start+1) / b + ((start+1) % b != 0);
|
|
init *= b;
|
|
--init;
|
|
}
|
|
C c(init, 0);
|
|
for (int i = 0; i < init-start; ++i)
|
|
c.pop_back();
|
|
for (int i = 0; i < size; ++i)
|
|
c.push_back(i);
|
|
for (int i = 0; i < start; ++i)
|
|
c.pop_front();
|
|
return c;
|
|
}
|
|
|
|
template <class C>
|
|
void
|
|
test(int P, C& c1)
|
|
{
|
|
typedef typename C::iterator I;
|
|
assert(P < c1.size());
|
|
std::size_t c1_osize = c1.size();
|
|
I i = c1.erase(c1.cbegin() + P);
|
|
assert(i == c1.begin() + P);
|
|
assert(c1.size() == c1_osize - 1);
|
|
assert(distance(c1.begin(), c1.end()) == c1.size());
|
|
i = c1.begin();
|
|
int j = 0;
|
|
for (; j < P; ++j, ++i)
|
|
assert(*i == j);
|
|
for (++j; j < c1_osize; ++j, ++i)
|
|
assert(*i == j);
|
|
}
|
|
|
|
template <class C>
|
|
void
|
|
testN(int start, int N)
|
|
{
|
|
int pstep = std::max(N / std::max(std::min(N, 10), 1), 1);
|
|
for (int p = 0; p < N; p += pstep)
|
|
{
|
|
C c1 = make<C>(N, start);
|
|
test(p, c1);
|
|
}
|
|
}
|
|
|
|
int main()
|
|
{
|
|
{
|
|
int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
|
|
const int N = sizeof(rng)/sizeof(rng[0]);
|
|
for (int i = 0; i < N; ++i)
|
|
for (int j = 0; j < N; ++j)
|
|
testN<std::deque<int> >(rng[i], rng[j]);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
|
|
const int N = sizeof(rng)/sizeof(rng[0]);
|
|
for (int i = 0; i < N; ++i)
|
|
for (int j = 0; j < N; ++j)
|
|
testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
|
|
}
|
|
#endif
|
|
}
|