cxx/test/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp
Howard Hinnant bc8d3f97eb libcxx initial import
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103490 91177308-0d34-0410-b5e6-96231b3b80d8
2010-05-11 19:42:16 +00:00

111 lines
3.9 KiB
C++

//===----------------------------------------------------------------------===//
//
// ÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊThe LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <algorithm>
// template<ForwardIterator Iter1, ForwardIterator Iter2>
// requires HasSwap<Iter1::reference, Iter2::reference>
// Iter2
// swap_ranges(Iter1 first1, Iter1 last1, Iter2 first2);
#include <algorithm>
#include <cassert>
#ifdef _LIBCPP_MOVE
#include <memory>
#endif
#include "../../iterators.h"
template<class Iter1, class Iter2>
void
test()
{
int i[3] = {1, 2, 3};
int j[3] = {4, 5, 6};
Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j));
assert(base(r) == j+3);
assert(i[0] == 4);
assert(i[1] == 5);
assert(i[2] == 6);
assert(j[0] == 1);
assert(j[1] == 2);
assert(j[2] == 3);
}
#ifdef _LIBCPP_MOVE
template<class Iter1, class Iter2>
void
test1()
{
std::unique_ptr<int> i[3];
for (int k = 0; k < 3; ++k)
i[k].reset(new int(k+1));
std::unique_ptr<int> j[3];
for (int k = 0; k < 3; ++k)
j[k].reset(new int(k+4));
Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j));
assert(base(r) == j+3);
assert(*i[0] == 4);
assert(*i[1] == 5);
assert(*i[2] == 6);
assert(*j[0] == 1);
assert(*j[1] == 2);
assert(*j[2] == 3);
}
#endif
int main()
{
test<forward_iterator<int*>, forward_iterator<int*> >();
test<forward_iterator<int*>, bidirectional_iterator<int*> >();
test<forward_iterator<int*>, random_access_iterator<int*> >();
test<forward_iterator<int*>, int*>();
test<bidirectional_iterator<int*>, forward_iterator<int*> >();
test<bidirectional_iterator<int*>, bidirectional_iterator<int*> >();
test<bidirectional_iterator<int*>, random_access_iterator<int*> >();
test<bidirectional_iterator<int*>, int*>();
test<random_access_iterator<int*>, forward_iterator<int*> >();
test<random_access_iterator<int*>, bidirectional_iterator<int*> >();
test<random_access_iterator<int*>, random_access_iterator<int*> >();
test<random_access_iterator<int*>, int*>();
test<int*, forward_iterator<int*> >();
test<int*, bidirectional_iterator<int*> >();
test<int*, random_access_iterator<int*> >();
test<int*, int*>();
#ifdef _LIBCPP_MOVE
test1<forward_iterator<std::unique_ptr<int>*>, forward_iterator<std::unique_ptr<int>*> >();
test1<forward_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >();
test1<forward_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >();
test1<forward_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
test1<bidirectional_iterator<std::unique_ptr<int>*>, forward_iterator<std::unique_ptr<int>*> >();
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>*>, forward_iterator<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>*, forward_iterator<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
}