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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// XFAIL: c++03, c++98
// <iterator>
// template <class C> auto begin(C& c) -> decltype(c.begin());
// template <class C> auto begin(const C& c) -> decltype(c.begin());
// template <class C> auto end(C& c) -> decltype(c.end());
// template <class C> auto end(const C& c) -> decltype(c.end());
// template <class E> reverse_iterator<const E*> rbegin(initializer_list<E> il);
// template <class E> reverse_iterator<const E*> rend(initializer_list<E> il);
#include "test_macros.h"
#include <iterator>
#include <cassert>
#include <vector>
#include <array>
#include <list>
#include <initializer_list>
template<typename C>
void test_const_container( const C & c, typename C::value_type val ) {
assert ( std::begin(c) == c.begin());
assert (*std::begin(c) == val );
assert ( std::begin(c) != c.end());
assert ( std::end(c) == c.end());
#if _LIBCPP_STD_VER > 11
assert ( std::cbegin(c) == c.cbegin());
assert ( std::cbegin(c) != c.cend());
assert ( std::cend(c) == c.cend());
assert ( std::rbegin(c) == c.rbegin());
assert ( std::rbegin(c) != c.rend());
assert ( std::rend(c) == c.rend());
assert ( std::crbegin(c) == c.crbegin());
assert ( std::crbegin(c) != c.crend());
assert ( std::crend(c) == c.crend());
#endif
}
template<typename T>
void test_const_container( const std::initializer_list<T> & c, T val ) {
assert ( std::begin(c) == c.begin());
assert (*std::begin(c) == val );
assert ( std::begin(c) != c.end());
assert ( std::end(c) == c.end());
#if _LIBCPP_STD_VER > 11
// initializer_list doesn't have cbegin/cend/rbegin/rend
// but std::cbegin(),etc work (b/c they're general fn templates)
// assert ( std::cbegin(c) == c.cbegin());
// assert ( std::cbegin(c) != c.cend());
// assert ( std::cend(c) == c.cend());
// assert ( std::rbegin(c) == c.rbegin());
// assert ( std::rbegin(c) != c.rend());
// assert ( std::rend(c) == c.rend());
// assert ( std::crbegin(c) == c.crbegin());
// assert ( std::crbegin(c) != c.crend());
// assert ( std::crend(c) == c.crend());
#endif
}
template<typename C>
void test_container( C & c, typename C::value_type val ) {
assert ( std::begin(c) == c.begin());
assert (*std::begin(c) == val );
assert ( std::begin(c) != c.end());
assert ( std::end(c) == c.end());
#if _LIBCPP_STD_VER > 11
assert ( std::cbegin(c) == c.cbegin());
assert ( std::cbegin(c) != c.cend());
assert ( std::cend(c) == c.cend());
assert ( std::rbegin(c) == c.rbegin());
assert ( std::rbegin(c) != c.rend());
assert ( std::rend(c) == c.rend());
assert ( std::crbegin(c) == c.crbegin());
assert ( std::crbegin(c) != c.crend());
assert ( std::crend(c) == c.crend());
#endif
}
template<typename T>
void test_container( std::initializer_list<T> & c, T val ) {
assert ( std::begin(c) == c.begin());
assert (*std::begin(c) == val );
assert ( std::begin(c) != c.end());
assert ( std::end(c) == c.end());
#if _LIBCPP_STD_VER > 11
// initializer_list doesn't have cbegin/cend/rbegin/rend
// assert ( std::cbegin(c) == c.cbegin());
// assert ( std::cbegin(c) != c.cend());
// assert ( std::cend(c) == c.cend());
// assert ( std::rbegin(c) == c.rbegin());
// assert ( std::rbegin(c) != c.rend());
// assert ( std::rend(c) == c.rend());
// assert ( std::crbegin(c) == c.crbegin());
// assert ( std::crbegin(c) != c.crend());
// assert ( std::crend(c) == c.crend());
#endif
}
template<typename T, size_t Sz>
void test_const_array( const T (&array)[Sz] ) {
assert ( std::begin(array) == array );
assert (*std::begin(array) == array[0] );
assert ( std::begin(array) != std::end(array));
assert ( std::end(array) == array + Sz);
#if _LIBCPP_STD_VER > 11
assert ( std::cbegin(array) == array );
assert (*std::cbegin(array) == array[0] );
assert ( std::cbegin(array) != std::cend(array));
assert ( std::cend(array) == array + Sz);
#endif
}
int main(){
std::vector<int> v; v.push_back(1);
std::list<int> l; l.push_back(2);
std::array<int, 1> a; a[0] = 3;
std::initializer_list<int> il = { 4 };
test_container ( v, 1 );
test_container ( l, 2 );
test_container ( a, 3 );
test_container ( il, 4 );
test_const_container ( v, 1 );
test_const_container ( l, 2 );
test_const_container ( a, 3 );
test_const_container ( il, 4 );
static constexpr int arrA [] { 1, 2, 3 };
test_const_array ( arrA );
#if _LIBCPP_STD_VER > 11
constexpr const int *b = std::cbegin(arrA);
constexpr const int *e = std::cend(arrA);
static_assert(e - b == 3, "");
#endif
}
|
