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 // <numeric>
10 
11 // template <InputIterator InIter,
12 //           OutputIterator<auto, const InIter::value_type&> OutIter>
13 //   requires HasMinus<InIter::value_type, InIter::value_type>
14 //         && Constructible<InIter::value_type, InIter::reference>
15 //         && OutputIterator<OutIter,
16 //                           HasMinus<InIter::value_type, InIter::value_type>::result_type>
17 //         && MoveAssignable<InIter::value_type>
18 //   OutIter
19 //   adjacent_difference(InIter first, InIter last, OutIter result);
20 
21 #include <numeric>
22 #include <cassert>
23 
24 #include "test_macros.h"
25 #include "test_iterators.h"
26 
27 template <class InIter, class OutIter>
28 void
29 test()
30 {
31     int ia[] = {15, 10, 6, 3, 1};
32     int ir[] = {15, -5, -4, -3, -2};
33     const unsigned s = sizeof(ia) / sizeof(ia[0]);
34     int ib[s] = {0};
35     OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib));
36     assert(base(r) == ib + s);
37     for (unsigned i = 0; i < s; ++i)
38         assert(ib[i] == ir[i]);
39 }
40 
41 #if TEST_STD_VER >= 11
42 
43 class Y;
44 
45 class X
46 {
47     int i_;
48 
49     X& operator=(const X&);
50 public:
51     explicit X(int i) : i_(i) {}
52     X(const X& x) : i_(x.i_) {}
53     X& operator=(X&& x)
54     {
55         i_ = x.i_;
56         x.i_ = -1;
57         return *this;
58     }
59 
60     friend X operator-(const X& x, const X& y) {return X(x.i_ - y.i_);}
61 
62     friend class Y;
63 };
64 
65 class Y
66 {
67     int i_;
68 
69     Y& operator=(const Y&);
70 public:
71     explicit Y(int i) : i_(i) {}
72     Y(const Y& y) : i_(y.i_) {}
73     void operator=(const X& x) {i_ = x.i_;}
74 };
75 
76 #endif
77 
78 int main(int, char**)
79 {
80     test<input_iterator<const int*>, output_iterator<int*> >();
81     test<input_iterator<const int*>, forward_iterator<int*> >();
82     test<input_iterator<const int*>, bidirectional_iterator<int*> >();
83     test<input_iterator<const int*>, random_access_iterator<int*> >();
84     test<input_iterator<const int*>, int*>();
85 
86     test<forward_iterator<const int*>, output_iterator<int*> >();
87     test<forward_iterator<const int*>, forward_iterator<int*> >();
88     test<forward_iterator<const int*>, bidirectional_iterator<int*> >();
89     test<forward_iterator<const int*>, random_access_iterator<int*> >();
90     test<forward_iterator<const int*>, int*>();
91 
92     test<bidirectional_iterator<const int*>, output_iterator<int*> >();
93     test<bidirectional_iterator<const int*>, forward_iterator<int*> >();
94     test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >();
95     test<bidirectional_iterator<const int*>, random_access_iterator<int*> >();
96     test<bidirectional_iterator<const int*>, int*>();
97 
98     test<random_access_iterator<const int*>, output_iterator<int*> >();
99     test<random_access_iterator<const int*>, forward_iterator<int*> >();
100     test<random_access_iterator<const int*>, bidirectional_iterator<int*> >();
101     test<random_access_iterator<const int*>, random_access_iterator<int*> >();
102     test<random_access_iterator<const int*>, int*>();
103 
104     test<const int*, output_iterator<int*> >();
105     test<const int*, forward_iterator<int*> >();
106     test<const int*, bidirectional_iterator<int*> >();
107     test<const int*, random_access_iterator<int*> >();
108     test<const int*, int*>();
109 
110 #if TEST_STD_VER >= 11
111     X x[3] = {X(1), X(2), X(3)};
112     Y y[3] = {Y(1), Y(2), Y(3)};
113     std::adjacent_difference(x, x+3, y);
114 #endif
115 
116   return 0;
117 }
118