diff options
author | Howard Hinnant <hhinnant@apple.com> | 2010-05-11 19:42:16 +0000 |
---|---|---|
committer | Howard Hinnant <hhinnant@apple.com> | 2010-05-11 19:42:16 +0000 |
commit | 3e519524c118651123eecf60c2bbc5d65ad9bac3 (patch) | |
tree | b2dd4168cfe448920a602cd7d2e40f95da187153 /libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp | |
parent | 9132c59d43b6c590c9bb33496eebf9f192d6857a (diff) | |
download | bcm5719-llvm-3e519524c118651123eecf60c2bbc5d65ad9bac3.tar.gz bcm5719-llvm-3e519524c118651123eecf60c2bbc5d65ad9bac3.zip |
libcxx initial import
llvm-svn: 103490
Diffstat (limited to 'libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp')
-rw-r--r-- | libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp | 134 |
1 files changed, 134 insertions, 0 deletions
diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp new file mode 100644 index 00000000000..633519fe18b --- /dev/null +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp @@ -0,0 +1,134 @@ +//===----------------------------------------------------------------------===// +// +// ΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚΚThe LLVM Compiler Infrastructure +// +// This file is distributed under the University of Illinois Open Source +// License. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +// <algorithm> + +// template<InputIterator InIter, typename OutIter> +// requires OutputIterator<OutIter, RvalueOf<InIter::reference>::type> +// OutIter +// move(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(InIter(ia), InIter(ia+N), OutIter(ib)); + assert(base(r) == ib+N); + 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(InIter(ia), InIter(ia+N), OutIter(ib)); + assert(base(r) == ib+N); + for (unsigned i = 0; i < N; ++i) + assert(*ib[i] == i); +} + +#endif + +int main() +{ + test<input_iterator<const int*>, output_iterator<int*> >(); + test<input_iterator<const int*>, input_iterator<int*> >(); + test<input_iterator<const int*>, forward_iterator<int*> >(); + test<input_iterator<const int*>, bidirectional_iterator<int*> >(); + test<input_iterator<const int*>, random_access_iterator<int*> >(); + test<input_iterator<const int*>, int*>(); + + test<forward_iterator<const int*>, output_iterator<int*> >(); + test<forward_iterator<const int*>, input_iterator<int*> >(); + test<forward_iterator<const int*>, forward_iterator<int*> >(); + test<forward_iterator<const int*>, bidirectional_iterator<int*> >(); + test<forward_iterator<const int*>, random_access_iterator<int*> >(); + test<forward_iterator<const int*>, int*>(); + + test<bidirectional_iterator<const int*>, output_iterator<int*> >(); + test<bidirectional_iterator<const int*>, input_iterator<int*> >(); + test<bidirectional_iterator<const int*>, forward_iterator<int*> >(); + 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*>, output_iterator<int*> >(); + test<random_access_iterator<const int*>, input_iterator<int*> >(); + test<random_access_iterator<const int*>, forward_iterator<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*, output_iterator<int*> >(); + test<const int*, input_iterator<int*> >(); + test<const int*, forward_iterator<int*> >(); + test<const int*, bidirectional_iterator<int*> >(); + test<const int*, random_access_iterator<int*> >(); + test<const int*, int*>(); + +#ifdef _LIBCPP_MOVE + test1<input_iterator<std::unique_ptr<int>*>, output_iterator<std::unique_ptr<int>*> >(); + test1<input_iterator<std::unique_ptr<int>*>, input_iterator<std::unique_ptr<int>*> >(); + test1<input_iterator<std::unique_ptr<int>*>, forward_iterator<std::unique_ptr<int>*> >(); + test1<input_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >(); + test1<input_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >(); + test1<input_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>(); + + test1<forward_iterator<std::unique_ptr<int>*>, output_iterator<std::unique_ptr<int>*> >(); + test1<forward_iterator<std::unique_ptr<int>*>, input_iterator<std::unique_ptr<int>*> >(); + 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>*>, output_iterator<std::unique_ptr<int>*> >(); + test1<bidirectional_iterator<std::unique_ptr<int>*>, input_iterator<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>*>, output_iterator<std::unique_ptr<int>*> >(); + test1<random_access_iterator<std::unique_ptr<int>*>, input_iterator<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>*, output_iterator<std::unique_ptr<int>*> >(); + test1<std::unique_ptr<int>*, input_iterator<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 +} |