4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
84 lines
2.9 KiB
C++
84 lines
2.9 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <list>
|
|
|
|
// iterator erase(const_iterator first, const_iterator last);
|
|
|
|
#include <list>
|
|
#include <cassert>
|
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
int a1[] = {1, 2, 3};
|
|
{
|
|
std::list<int> l1(a1, a1+3);
|
|
std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
|
|
assert(l1.size() == 3);
|
|
assert(distance(l1.cbegin(), l1.cend()) == 3);
|
|
assert(i == l1.begin());
|
|
}
|
|
{
|
|
std::list<int> l1(a1, a1+3);
|
|
std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
|
|
assert(l1.size() == 2);
|
|
assert(distance(l1.cbegin(), l1.cend()) == 2);
|
|
assert(i == l1.begin());
|
|
assert(l1 == std::list<int>(a1+1, a1+3));
|
|
}
|
|
{
|
|
std::list<int> l1(a1, a1+3);
|
|
std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
|
|
assert(l1.size() == 1);
|
|
assert(distance(l1.cbegin(), l1.cend()) == 1);
|
|
assert(i == l1.begin());
|
|
assert(l1 == std::list<int>(a1+2, a1+3));
|
|
}
|
|
{
|
|
std::list<int> l1(a1, a1+3);
|
|
std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
|
|
assert(l1.size() == 0);
|
|
assert(distance(l1.cbegin(), l1.cend()) == 0);
|
|
assert(i == l1.begin());
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
std::list<int, min_allocator<int>> l1(a1, a1+3);
|
|
std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
|
|
assert(l1.size() == 3);
|
|
assert(distance(l1.cbegin(), l1.cend()) == 3);
|
|
assert(i == l1.begin());
|
|
}
|
|
{
|
|
std::list<int, min_allocator<int>> l1(a1, a1+3);
|
|
std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
|
|
assert(l1.size() == 2);
|
|
assert(distance(l1.cbegin(), l1.cend()) == 2);
|
|
assert(i == l1.begin());
|
|
assert((l1 == std::list<int, min_allocator<int>>(a1+1, a1+3)));
|
|
}
|
|
{
|
|
std::list<int, min_allocator<int>> l1(a1, a1+3);
|
|
std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
|
|
assert(l1.size() == 1);
|
|
assert(distance(l1.cbegin(), l1.cend()) == 1);
|
|
assert(i == l1.begin());
|
|
assert((l1 == std::list<int, min_allocator<int>>(a1+2, a1+3)));
|
|
}
|
|
{
|
|
std::list<int, min_allocator<int>> l1(a1, a1+3);
|
|
std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3));
|
|
assert(l1.size() == 0);
|
|
assert(distance(l1.cbegin(), l1.cend()) == 0);
|
|
assert(i == l1.begin());
|
|
}
|
|
#endif
|
|
}
|