diff options
author | Eric Fiselier <eric@efcs.ca> | 2014-12-20 01:40:03 +0000 |
---|---|---|
committer | Eric Fiselier <eric@efcs.ca> | 2014-12-20 01:40:03 +0000 |
commit | 5a83710e371fe68a06e6e3876c6a2c8b820a8976 (patch) | |
tree | afde4c82ad6704681781c5cd49baa3fbd05c85db /libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp | |
parent | f11e8eab527fba316c64112f6e05de1a79693a3e (diff) | |
download | bcm5719-llvm-5a83710e371fe68a06e6e3876c6a2c8b820a8976.tar.gz bcm5719-llvm-5a83710e371fe68a06e6e3876c6a2c8b820a8976.zip |
Move test into test/std subdirectory.
llvm-svn: 224658
Diffstat (limited to 'libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp')
-rw-r--r-- | libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp | 83 |
1 files changed, 0 insertions, 83 deletions
diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp deleted file mode 100644 index 80f86568c4d..00000000000 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp +++ /dev/null @@ -1,83 +0,0 @@ -//===----------------------------------------------------------------------===// -// -// 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. -// -//===----------------------------------------------------------------------===// - -// <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> -#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES -#include <memory> -#endif - -#include "test_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); -} - -#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES - -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 // _LIBCPP_HAS_NO_RVALUE_REFERENCES - -int main() -{ - test<forward_iterator<int*> >(); - test<bidirectional_iterator<int*> >(); - test<random_access_iterator<int*> >(); - test<int*>(); - -#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES - - 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 // _LIBCPP_HAS_NO_RVALUE_REFERENCES -} |