1 //===----------------------------------------------------------------------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 9 // <algorithm> 10 11 // template<BidirectionalIterator InIter, BidirectionalIterator OutIter> 12 // requires OutputIterator<OutIter, RvalueOf<InIter::reference>::type> 13 // OutIter 14 // move_backward(InIter first, InIter last, OutIter result); 15 16 #include <algorithm> 17 #include <cassert> 18 #include <memory> 19 20 #include "test_macros.h" 21 #include "test_iterators.h" 22 23 template <class InIter, class OutIter> 24 _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 25 test() 26 { 27 const unsigned N = 1000; 28 int ia[N] = {}; 29 for (unsigned i = 0; i < N; ++i) 30 ia[i] = i; 31 int ib[N] = {0}; 32 33 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); 34 assert(base(r) == ib); 35 for (unsigned i = 0; i < N; ++i) 36 assert(ia[i] == ib[i]); 37 38 return true; 39 } 40 41 #if TEST_STD_VER >= 11 42 template <class InIter, class OutIter> 43 void 44 test1() 45 { 46 const unsigned N = 100; 47 std::unique_ptr<int> ia[N]; 48 for (unsigned i = 0; i < N; ++i) 49 ia[i].reset(new int(i)); 50 std::unique_ptr<int> ib[N]; 51 52 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); 53 assert(base(r) == ib); 54 for (unsigned i = 0; i < N; ++i) 55 assert(*ib[i] == static_cast<int>(i)); 56 } 57 #endif 58 59 int main(int, char**) 60 { 61 test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >(); 62 test<bidirectional_iterator<const int*>, random_access_iterator<int*> >(); 63 test<bidirectional_iterator<const int*>, int*>(); 64 65 test<random_access_iterator<const int*>, bidirectional_iterator<int*> >(); 66 test<random_access_iterator<const int*>, random_access_iterator<int*> >(); 67 test<random_access_iterator<const int*>, int*>(); 68 69 test<const int*, bidirectional_iterator<int*> >(); 70 test<const int*, random_access_iterator<int*> >(); 71 test<const int*, int*>(); 72 73 #if TEST_STD_VER >= 11 74 test1<bidirectional_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >(); 75 test1<bidirectional_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >(); 76 test1<bidirectional_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>(); 77 78 test1<random_access_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >(); 79 test1<random_access_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >(); 80 test1<random_access_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>(); 81 82 test1<std::unique_ptr<int>*, bidirectional_iterator<std::unique_ptr<int>*> >(); 83 test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >(); 84 test1<std::unique_ptr<int>*, std::unique_ptr<int>*>(); 85 #endif // TEST_STD_VER >= 11 86 87 #if TEST_STD_VER > 17 88 static_assert(test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >()); 89 static_assert(test<bidirectional_iterator<const int*>, random_access_iterator<int*> >()); 90 static_assert(test<bidirectional_iterator<const int*>, int*>()); 91 92 static_assert(test<random_access_iterator<const int*>, bidirectional_iterator<int*> >()); 93 static_assert(test<random_access_iterator<const int*>, random_access_iterator<int*> >()); 94 static_assert(test<random_access_iterator<const int*>, int*>()); 95 96 static_assert(test<const int*, bidirectional_iterator<int*> >()); 97 static_assert(test<const int*, random_access_iterator<int*> >()); 98 static_assert(test<const int*, int*>()); 99 #endif // TEST_STD_VER > 17 100 101 return 0; 102 } 103