1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <numeric>
// template<InputIterator InIter,
// OutputIterator<auto, const InIter::value_type&> OutIter,
// Callable<auto, const InIter::value_type&, InIter::reference> BinaryOperation>
// requires HasAssign<InIter::value_type, BinaryOperation::result_type>
// && Constructible<InIter::value_type, InIter::reference>
// && CopyConstructible<BinaryOperation>
// OutIter
// partial_sum(InIter first, InIter last, OutIter result, BinaryOperation binary_op);
#include <numeric>
#include <functional>
#include <string>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
#if TEST_STD_VER > 17
struct rvalue_addable
{
bool correctOperatorUsed = false;
// make sure the predicate is passed an rvalue and an lvalue (so check that the first argument was moved)
rvalue_addable operator()(rvalue_addable&& r, rvalue_addable const&) {
r.correctOperatorUsed = true;
return std::move(r);
}
};
rvalue_addable operator+(rvalue_addable& lhs, rvalue_addable const&)
{
lhs.correctOperatorUsed = false;
return lhs;
}
rvalue_addable operator+(rvalue_addable&& lhs, rvalue_addable const&)
{
lhs.correctOperatorUsed = true;
return std::move(lhs);
}
void
test_use_move()
{
const std::size_t size = 100;
rvalue_addable arr[size];
rvalue_addable res1[size];
rvalue_addable res2[size];
std::partial_sum(arr, arr + size, res1);
std::partial_sum(arr, arr + size, res2, /*predicate=*/rvalue_addable());
// start at 1 because the first element is not moved
for (unsigned i = 1; i < size; ++i) assert(res1[i].correctOperatorUsed);
for (unsigned i = 1; i < size; ++i) assert(res2[i].correctOperatorUsed);
}
#endif // TEST_STD_VER > 17
void
test_string()
{
std::string sa[] = {"a", "b", "c"};
std::string sr[] = {"a", "ba", "cb"};
std::string output[3];
std::adjacent_difference(sa, sa + 3, output, std::plus<std::string>());
for (unsigned i = 0; i < 3; ++i) assert(output[i] == sr[i]);
}
template <class InIter, class OutIter>
void
test()
{
int ia[] = {1, 2, 3, 4, 5};
int ir[] = {1, -1, -4, -8, -13};
const unsigned s = sizeof(ia) / sizeof(ia[0]);
int ib[s] = {0};
OutIter r = std::partial_sum(InIter(ia), InIter(ia+s), OutIter(ib), std::minus<int>());
assert(base(r) == ib + s);
for (unsigned i = 0; i < s; ++i)
assert(ib[i] == ir[i]);
}
int main(int, char**)
{
test<input_iterator<const int*>, output_iterator<int*> >();
test<input_iterator<const int*>, forward_iterator<int*> >();
test<input_iterator<const int*>, bidirectional_iterator<int*> >();
test<input_iterator<const int*>, random_access_iterator<int*> >();
test<input_iterator<const int*>, int*>();
test<forward_iterator<const int*>, output_iterator<int*> >();
test<forward_iterator<const int*>, forward_iterator<int*> >();
test<forward_iterator<const int*>, bidirectional_iterator<int*> >();
test<forward_iterator<const int*>, random_access_iterator<int*> >();
test<forward_iterator<const int*>, int*>();
test<bidirectional_iterator<const int*>, output_iterator<int*> >();
test<bidirectional_iterator<const int*>, forward_iterator<int*> >();
test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >();
test<bidirectional_iterator<const int*>, random_access_iterator<int*> >();
test<bidirectional_iterator<const int*>, int*>();
test<random_access_iterator<const int*>, output_iterator<int*> >();
test<random_access_iterator<const int*>, forward_iterator<int*> >();
test<random_access_iterator<const int*>, bidirectional_iterator<int*> >();
test<random_access_iterator<const int*>, random_access_iterator<int*> >();
test<random_access_iterator<const int*>, int*>();
test<const int*, output_iterator<int*> >();
test<const int*, forward_iterator<int*> >();
test<const int*, bidirectional_iterator<int*> >();
test<const int*, random_access_iterator<int*> >();
test<const int*, int*>();
#if TEST_STD_VER > 17
test_use_move();
#endif // TEST_STD_VER > 17
test_string();
return 0;
}
|
