84 lines
2.0 KiB
C++
84 lines
2.0 KiB
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
|
//
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
|||
|
|
//
|
|||
|
|
// This file is distributed under the University of Illinois Open Source
|
|||
|
|
// License. See LICENSE.TXT for details.
|
|||
|
|
//
|
|||
|
|
//===----------------------------------------------------------------------===//
|
|||
|
|
|
|||
|
|
// <algorithm>
|
|||
|
|
|
|||
|
|
// template<ForwardIterator Iter, class T>
|
|||
|
|
// requires OutputIterator<Iter, RvalueOf<Iter::reference>::type>
|
|||
|
|
// && HasEqualTo<Iter::value_type, T>
|
|||
|
|
// Iter
|
|||
|
|
// remove(Iter first, Iter last, const T& value);
|
|||
|
|
|
|||
|
|
#include <algorithm>
|
|||
|
|
#include <cassert>
|
|||
|
|
#ifdef _LIBCPP_MOVE
|
|||
|
|
#include <memory>
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
#include "../../iterators.h"
|
|||
|
|
|
|||
|
|
template <class Iter>
|
|||
|
|
void
|
|||
|
|
test()
|
|||
|
|
{
|
|||
|
|
int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2};
|
|||
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|||
|
|
Iter r = std::remove(Iter(ia), Iter(ia+sa), 2);
|
|||
|
|
assert(base(r) == ia + sa-3);
|
|||
|
|
assert(ia[0] == 0);
|
|||
|
|
assert(ia[1] == 1);
|
|||
|
|
assert(ia[2] == 3);
|
|||
|
|
assert(ia[3] == 4);
|
|||
|
|
assert(ia[4] == 3);
|
|||
|
|
assert(ia[5] == 4);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
#ifdef _LIBCPP_MOVE
|
|||
|
|
|
|||
|
|
template <class Iter>
|
|||
|
|
void
|
|||
|
|
test1()
|
|||
|
|
{
|
|||
|
|
const unsigned sa = 9;
|
|||
|
|
std::unique_ptr<int> ia[sa];
|
|||
|
|
ia[0].reset(new int(0));
|
|||
|
|
ia[1].reset(new int(1));
|
|||
|
|
ia[3].reset(new int(3));
|
|||
|
|
ia[4].reset(new int(4));
|
|||
|
|
ia[6].reset(new int(3));
|
|||
|
|
ia[7].reset(new int(4));
|
|||
|
|
Iter r = std::remove(Iter(ia), Iter(ia+sa), std::unique_ptr<int>());
|
|||
|
|
assert(base(r) == ia + sa-3);
|
|||
|
|
assert(*ia[0] == 0);
|
|||
|
|
assert(*ia[1] == 1);
|
|||
|
|
assert(*ia[2] == 3);
|
|||
|
|
assert(*ia[3] == 4);
|
|||
|
|
assert(*ia[4] == 3);
|
|||
|
|
assert(*ia[5] == 4);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
test<forward_iterator<int*> >();
|
|||
|
|
test<bidirectional_iterator<int*> >();
|
|||
|
|
test<random_access_iterator<int*> >();
|
|||
|
|
test<int*>();
|
|||
|
|
|
|||
|
|
#ifdef _LIBCPP_MOVE
|
|||
|
|
|
|||
|
|
test1<forward_iterator<std::unique_ptr<int>*> >();
|
|||
|
|
test1<bidirectional_iterator<std::unique_ptr<int>*> >();
|
|||
|
|
test1<random_access_iterator<std::unique_ptr<int>*> >();
|
|||
|
|
test1<std::unique_ptr<int>*>();
|
|||
|
|
|
|||
|
|
#endif
|
|||
|
|
}
|