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 void 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 39 #if TEST_STD_VER >= 11 40 template <class InIter, class OutIter> 41 void 42 test1() 43 { 44 const unsigned N = 100; 45 std::unique_ptr<int> ia[N]; 46 for (unsigned i = 0; i < N; ++i) 47 ia[i].reset(new int(i)); 48 std::unique_ptr<int> ib[N]; 49 50 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); 51 assert(base(r) == ib); 52 for (unsigned i = 0; i < N; ++i) 53 assert(*ib[i] == static_cast<int>(i)); 54 } 55 #endif 56 57 int main(int, char**) 58 { 59 test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >(); 60 test<bidirectional_iterator<const int*>, random_access_iterator<int*> >(); 61 test<bidirectional_iterator<const int*>, int*>(); 62 63 test<random_access_iterator<const int*>, bidirectional_iterator<int*> >(); 64 test<random_access_iterator<const int*>, random_access_iterator<int*> >(); 65 test<random_access_iterator<const int*>, int*>(); 66 67 test<const int*, bidirectional_iterator<int*> >(); 68 test<const int*, random_access_iterator<int*> >(); 69 test<const int*, int*>(); 70 71 #if TEST_STD_VER >= 11 72 test1<bidirectional_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >(); 73 test1<bidirectional_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >(); 74 test1<bidirectional_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>(); 75 76 test1<random_access_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*> >(); 77 test1<random_access_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*> >(); 78 test1<random_access_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>(); 79 80 test1<std::unique_ptr<int>*, bidirectional_iterator<std::unique_ptr<int>*> >(); 81 test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >(); 82 test1<std::unique_ptr<int>*, std::unique_ptr<int>*>(); 83 #endif // TEST_STD_VER >= 11 84 85 return 0; 86 } 87