2c39cbe020
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@185093 91177308-0d34-0410-b5e6-96231b3b80d8
66 lines
1.8 KiB
C++
66 lines
1.8 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <vector>
|
|
// vector<bool>
|
|
|
|
// iterator erase(const_iterator position);
|
|
|
|
#include <vector>
|
|
#include <cassert>
|
|
|
|
#include "../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
bool a1[] = {1, 0, 1};
|
|
{
|
|
std::vector<bool> l1(a1, a1+3);
|
|
std::vector<bool>::const_iterator i = l1.begin();
|
|
++i;
|
|
std::vector<bool>::iterator j = l1.erase(i);
|
|
assert(l1.size() == 2);
|
|
assert(distance(l1.begin(), l1.end()) == 2);
|
|
assert(*j == true);
|
|
assert(*l1.begin() == 1);
|
|
assert(*next(l1.begin()) == true);
|
|
j = l1.erase(j);
|
|
assert(j == l1.end());
|
|
assert(l1.size() == 1);
|
|
assert(distance(l1.begin(), l1.end()) == 1);
|
|
assert(*l1.begin() == true);
|
|
j = l1.erase(l1.begin());
|
|
assert(j == l1.end());
|
|
assert(l1.size() == 0);
|
|
assert(distance(l1.begin(), l1.end()) == 0);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
std::vector<bool, min_allocator<bool>> l1(a1, a1+3);
|
|
std::vector<bool, min_allocator<bool>>::const_iterator i = l1.begin();
|
|
++i;
|
|
std::vector<bool, min_allocator<bool>>::iterator j = l1.erase(i);
|
|
assert(l1.size() == 2);
|
|
assert(distance(l1.begin(), l1.end()) == 2);
|
|
assert(*j == true);
|
|
assert(*l1.begin() == 1);
|
|
assert(*next(l1.begin()) == true);
|
|
j = l1.erase(j);
|
|
assert(j == l1.end());
|
|
assert(l1.size() == 1);
|
|
assert(distance(l1.begin(), l1.end()) == 1);
|
|
assert(*l1.begin() == true);
|
|
j = l1.erase(l1.begin());
|
|
assert(j == l1.end());
|
|
assert(l1.size() == 0);
|
|
assert(distance(l1.begin(), l1.end()) == 0);
|
|
}
|
|
#endif
|
|
}
|