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
|
// Copyright 2025 Peter Dimov
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
#include <boost/array.hpp>
#include <boost/core/lightweight_test.hpp>
#include <iterator>
#include <cstddef>
template<class T, std::size_t N> void test()
{
{
boost::array<T, N> a = {{}};
{
std::reverse_iterator<T*> r1( a.rbegin() );
std::reverse_iterator<T*> r2( a.end() );
BOOST_TEST( r1 == r2 );
}
{
std::reverse_iterator<T*> r1( a.rend() );
std::reverse_iterator<T*> r2( a.begin() );
BOOST_TEST( r1 == r2 );
}
{
std::reverse_iterator<T const*> r1( a.crbegin() );
std::reverse_iterator<T const*> r2( a.cend() );
BOOST_TEST( r1 == r2 );
}
{
std::reverse_iterator<T const*> r1( a.crend() );
std::reverse_iterator<T const*> r2( a.cbegin() );
BOOST_TEST( r1 == r2 );
}
}
{
boost::array<T, N> const a = {{}};
{
std::reverse_iterator<T const*> r1( a.rbegin() );
std::reverse_iterator<T const*> r2( a.end() );
BOOST_TEST( r1 == r2 );
}
{
std::reverse_iterator<T const*> r1( a.rend() );
std::reverse_iterator<T const*> r2( a.begin() );
BOOST_TEST( r1 == r2 );
}
{
std::reverse_iterator<T const*> r1( a.crbegin() );
std::reverse_iterator<T const*> r2( a.cend() );
BOOST_TEST( r1 == r2 );
}
{
std::reverse_iterator<T const*> r1( a.crend() );
std::reverse_iterator<T const*> r2( a.cbegin() );
BOOST_TEST( r1 == r2 );
}
}
}
int main()
{
test<int, 0>();
test<int, 1>();
test<int, 7>();
test<int const, 0>();
test<int const, 1>();
test<int const, 7>();
return boost::report_errors();
}
|
