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 TEST_CONSTEXPR_CXX17 bool
test()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
test1()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 
main(int,char **)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     test<bidirectional_iterator<const int*>, contiguous_iterator<int*>>();
89     test<random_access_iterator<const int*>, contiguous_iterator<int*>>();
90     test<const int*, contiguous_iterator<int*>>();
91     test<contiguous_iterator<const int*>, bidirectional_iterator<int*>>();
92     test<contiguous_iterator<const int*>, random_access_iterator<int*>>();
93     test<contiguous_iterator<const int*>, int*>();
94     test<contiguous_iterator<const int*>, contiguous_iterator<int*>>();
95 
96     test1<bidirectional_iterator<std::unique_ptr<int>*>, contiguous_iterator<std::unique_ptr<int>*>>();
97     test1<random_access_iterator<std::unique_ptr<int>*>, contiguous_iterator<std::unique_ptr<int>*>>();
98     test1<std::unique_ptr<int>*, contiguous_iterator<std::unique_ptr<int>*>>();
99     test1<contiguous_iterator<std::unique_ptr<int>*>, bidirectional_iterator<std::unique_ptr<int>*>>();
100     test1<contiguous_iterator<std::unique_ptr<int>*>, random_access_iterator<std::unique_ptr<int>*>>();
101     test1<contiguous_iterator<std::unique_ptr<int>*>, std::unique_ptr<int>*>();
102     test1<contiguous_iterator<std::unique_ptr<int>*>, contiguous_iterator<std::unique_ptr<int>*>>();
103 
104     static_assert(test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >());
105     static_assert(test<bidirectional_iterator<const int*>, random_access_iterator<int*> >());
106     static_assert(test<bidirectional_iterator<const int*>, contiguous_iterator<int*> >());
107     static_assert(test<bidirectional_iterator<const int*>, int*>());
108 
109     static_assert(test<random_access_iterator<const int*>, bidirectional_iterator<int*> >());
110     static_assert(test<random_access_iterator<const int*>, random_access_iterator<int*> >());
111     static_assert(test<random_access_iterator<const int*>, contiguous_iterator<int*> >());
112     static_assert(test<random_access_iterator<const int*>, int*>());
113 
114     static_assert(test<contiguous_iterator<const int*>, bidirectional_iterator<int*> >());
115     static_assert(test<contiguous_iterator<const int*>, random_access_iterator<int*> >());
116     static_assert(test<contiguous_iterator<const int*>, contiguous_iterator<int*> >());
117     static_assert(test<contiguous_iterator<const int*>, int*>());
118 
119     static_assert(test<const int*, bidirectional_iterator<int*> >());
120     static_assert(test<const int*, random_access_iterator<int*> >());
121     static_assert(test<const int*, contiguous_iterator<int*> >());
122     static_assert(test<const int*, int*>());
123 #endif // TEST_STD_VER > 17
124 
125   return 0;
126 }
127