89 lines
2.8 KiB
C++
89 lines
2.8 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<BidirectionalIterator InIter, BidirectionalIterator OutIter>
|
|||
|
|
// requires OutputIterator<OutIter, RvalueOf<InIter::reference>::type>
|
|||
|
|
// OutIter
|
|||
|
|
// move_backward(InIter first, InIter last, OutIter result);
|
|||
|
|
|
|||
|
|
#include <algorithm>
|
|||
|
|
#include <cassert>
|
|||
|
|
#ifdef _LIBCPP_MOVE
|
|||
|
|
#include <memory>
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
#include "../../iterators.h"
|
|||
|
|
|
|||
|
|
template <class InIter, class OutIter>
|
|||
|
|
void
|
|||
|
|
test()
|
|||
|
|
{
|
|||
|
|
const unsigned N = 1000;
|
|||
|
|
int ia[N];
|
|||
|
|
for (unsigned i = 0; i < N; ++i)
|
|||
|
|
ia[i] = i;
|
|||
|
|
int ib[N] = {0};
|
|||
|
|
|
|||
|
|
OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
|
|||
|
|
assert(base(r) == ib);
|
|||
|
|
for (unsigned i = 0; i < N; ++i)
|
|||
|
|
assert(ia[i] == ib[i]);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
#ifdef _LIBCPP_MOVE
|
|||
|
|
|
|||
|
|
template <class InIter, class OutIter>
|
|||
|
|
void
|
|||
|
|
test1()
|
|||
|
|
{
|
|||
|
|
const unsigned N = 100;
|
|||
|
|
std::unique_ptr<int> ia[N];
|
|||
|
|
for (unsigned i = 0; i < N; ++i)
|
|||
|
|
ia[i].reset(new int(i));
|
|||
|
|
std::unique_ptr<int> ib[N];
|
|||
|
|
|
|||
|
|
OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
|
|||
|
|
assert(base(r) == ib);
|
|||
|
|
for (unsigned i = 0; i < N; ++i)
|
|||
|
|
assert(*ib[i] == i);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >();
|
|||
|
|
test<bidirectional_iterator<const int*>, random_access_iterator<int*> >();
|
|||
|
|
test<bidirectional_iterator<const int*>, int*>();
|
|||
|
|
|
|||
|
|
test<random_access_iterator<const int*>, bidirectional_iterator<int*> >();
|
|||
|
|
test<random_access_iterator<const int*>, random_access_iterator<int*> >();
|
|||
|
|
test<random_access_iterator<const int*>, int*>();
|
|||
|
|
|
|||
|
|
test<const int*, bidirectional_iterator<int*> >();
|
|||
|
|
test<const int*, random_access_iterator<int*> >();
|
|||
|
|
test<const int*, int*>();
|
|||
|
|
|
|||
|
|
#ifdef _LIBCPP_MOVE
|
|||
|
|
test1<bidirectional_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >();
|
|||
|
|
test1<bidirectional_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >();
|
|||
|
|
test1<bidirectional_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
|
|||
|
|
|
|||
|
|
test1<random_access_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >();
|
|||
|
|
test1<random_access_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >();
|
|||
|
|
test1<random_access_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
|
|||
|
|
|
|||
|
|
test1<std::unique_ptr<int>*, bidirectional_iterator<std::unique_ptr<int>*> >();
|
|||
|
|
test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >();
|
|||
|
|
test1<std::unique_ptr<int>*, std::unique_ptr<int>*>();
|
|||
|
|
#endif
|
|||
|
|
}
|