98 lines
3.1 KiB
C++
98 lines
3.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.
|
||
|
//
|
||
|
//===----------------------------------------------------------------------===//
|
||
|
|
||
|
// <forward_list>
|
||
|
|
||
|
// iterator erase_after(const_iterator p);
|
||
|
|
||
|
#include <forward_list>
|
||
|
#include <cassert>
|
||
|
|
||
|
#include "../../../min_allocator.h"
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T> C;
|
||
|
const T t[] = {0, 1, 2, 3, 4};
|
||
|
C c(std::begin(t), std::end(t));
|
||
|
|
||
|
C::iterator i = c.erase_after(next(c.cbefore_begin(), 4));
|
||
|
assert(i == c.end());
|
||
|
assert(distance(c.begin(), c.end()) == 4);
|
||
|
assert(*next(c.begin(), 0) == 0);
|
||
|
assert(*next(c.begin(), 1) == 1);
|
||
|
assert(*next(c.begin(), 2) == 2);
|
||
|
assert(*next(c.begin(), 3) == 3);
|
||
|
|
||
|
i = c.erase_after(next(c.cbefore_begin(), 0));
|
||
|
assert(i == c.begin());
|
||
|
assert(distance(c.begin(), c.end()) == 3);
|
||
|
assert(*next(c.begin(), 0) == 1);
|
||
|
assert(*next(c.begin(), 1) == 2);
|
||
|
assert(*next(c.begin(), 2) == 3);
|
||
|
|
||
|
i = c.erase_after(next(c.cbefore_begin(), 1));
|
||
|
assert(i == next(c.begin()));
|
||
|
assert(distance(c.begin(), c.end()) == 2);
|
||
|
assert(*next(c.begin(), 0) == 1);
|
||
|
assert(*next(c.begin(), 1) == 3);
|
||
|
|
||
|
i = c.erase_after(next(c.cbefore_begin(), 1));
|
||
|
assert(i == c.end());
|
||
|
assert(distance(c.begin(), c.end()) == 1);
|
||
|
assert(*next(c.begin(), 0) == 1);
|
||
|
|
||
|
i = c.erase_after(next(c.cbefore_begin(), 0));
|
||
|
assert(i == c.begin());
|
||
|
assert(i == c.end());
|
||
|
assert(distance(c.begin(), c.end()) == 0);
|
||
|
}
|
||
|
#if __cplusplus >= 201103L
|
||
|
{
|
||
|
typedef int T;
|
||
|
typedef std::forward_list<T, min_allocator<T>> C;
|
||
|
const T t[] = {0, 1, 2, 3, 4};
|
||
|
C c(std::begin(t), std::end(t));
|
||
|
|
||
|
C::iterator i = c.erase_after(next(c.cbefore_begin(), 4));
|
||
|
assert(i == c.end());
|
||
|
assert(distance(c.begin(), c.end()) == 4);
|
||
|
assert(*next(c.begin(), 0) == 0);
|
||
|
assert(*next(c.begin(), 1) == 1);
|
||
|
assert(*next(c.begin(), 2) == 2);
|
||
|
assert(*next(c.begin(), 3) == 3);
|
||
|
|
||
|
i = c.erase_after(next(c.cbefore_begin(), 0));
|
||
|
assert(i == c.begin());
|
||
|
assert(distance(c.begin(), c.end()) == 3);
|
||
|
assert(*next(c.begin(), 0) == 1);
|
||
|
assert(*next(c.begin(), 1) == 2);
|
||
|
assert(*next(c.begin(), 2) == 3);
|
||
|
|
||
|
i = c.erase_after(next(c.cbefore_begin(), 1));
|
||
|
assert(i == next(c.begin()));
|
||
|
assert(distance(c.begin(), c.end()) == 2);
|
||
|
assert(*next(c.begin(), 0) == 1);
|
||
|
assert(*next(c.begin(), 1) == 3);
|
||
|
|
||
|
i = c.erase_after(next(c.cbefore_begin(), 1));
|
||
|
assert(i == c.end());
|
||
|
assert(distance(c.begin(), c.end()) == 1);
|
||
|
assert(*next(c.begin(), 0) == 1);
|
||
|
|
||
|
i = c.erase_after(next(c.cbefore_begin(), 0));
|
||
|
assert(i == c.begin());
|
||
|
assert(i == c.end());
|
||
|
assert(distance(c.begin(), c.end()) == 0);
|
||
|
}
|
||
|
#endif
|
||
|
}
|