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
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <algorithm>
// template<BidirectionalIterator InIter, BidirectionalIterator OutIter>
// requires OutputIterator<OutIter, InIter::reference>
// constexpr OutIter // constexpr after C++17
// copy_backward(InIter first, InIter last, OutIter result);
#include <algorithm>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
#include "user_defined_integral.h"
class PaddedBase {
public:
TEST_CONSTEXPR PaddedBase(std::int16_t a, std::int8_t b) : a_(a), b_(b) {}
std::int16_t a_;
std::int8_t b_;
};
class Derived : public PaddedBase {
public:
TEST_CONSTEXPR Derived(std::int16_t a, std::int8_t b, std::int8_t c) : PaddedBase(a, b), c_(c) {}
std::int8_t c_;
};
template <class InIter, class OutIter>
TEST_CONSTEXPR_CXX20 void
test_copy_backward()
{
{
const unsigned N = 1000;
int ia[N] = {};
for (unsigned i = 0; i < N; ++i)
ia[i] = i;
int ib[N] = {0};
OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
assert(base(r) == ib);
for (unsigned i = 0; i < N; ++i)
assert(ia[i] == ib[i]);
}
}
TEST_CONSTEXPR_CXX20 bool
test()
{
test_copy_backward<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >();
test_copy_backward<bidirectional_iterator<const int*>, random_access_iterator<int*> >();
test_copy_backward<bidirectional_iterator<const int*>, int*>();
test_copy_backward<random_access_iterator<const int*>, bidirectional_iterator<int*> >();
test_copy_backward<random_access_iterator<const int*>, random_access_iterator<int*> >();
test_copy_backward<random_access_iterator<const int*>, int*>();
test_copy_backward<const int*, bidirectional_iterator<int*> >();
test_copy_backward<const int*, random_access_iterator<int*> >();
test_copy_backward<const int*, int*>();
#if TEST_STD_VER > 17
test_copy_backward<contiguous_iterator<const int*>, bidirectional_iterator<int*>>();
test_copy_backward<contiguous_iterator<const int*>, random_access_iterator<int*>>();
test_copy_backward<contiguous_iterator<const int*>, int*>();
test_copy_backward<bidirectional_iterator<const int*>, contiguous_iterator<int*>>();
test_copy_backward<random_access_iterator<const int*>, contiguous_iterator<int*>>();
test_copy_backward<contiguous_iterator<const int*>, contiguous_iterator<int*>>();
test_copy_backward<const int*, contiguous_iterator<int*>>();
#endif
{ // Make sure that padding bits aren't copied
Derived src(1, 2, 3);
Derived dst(4, 5, 6);
std::copy_backward(
static_cast<PaddedBase*>(&src), static_cast<PaddedBase*>(&src) + 1, static_cast<PaddedBase*>(&dst) + 1);
assert(dst.a_ == 1);
assert(dst.b_ == 2);
assert(dst.c_ == 6);
}
{ // Make sure that overlapping ranges can be copied
int a[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
std::copy_backward(a, a + 7, a + 10);
int expected[] = {1, 2, 3, 1, 2, 3, 4, 5, 6, 7};
assert(std::equal(a, a + 10, expected));
}
return true;
}
int main(int, char**)
{
test();
#if TEST_STD_VER > 17
static_assert(test());
#endif
return 0;
}
|
