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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
|
// Range v3 library
//
// Copyright Eric Niebler 2014-present
//
// Use, modification and distribution is subject to the
// Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Project home: https://github.com/ericniebler/range-v3
//
// The implementation of array has been adapted from libc++
// (http://libcxx.llvm.org).
//
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
#ifndef RANGES_V3_TEST_ARRAY_HPP
#define RANGES_V3_TEST_ARRAY_HPP
#include <stdexcept>
#include <range/v3/range_fwd.hpp>
#include <range/v3/iterator/operations.hpp>
#include <range/v3/algorithm/fill_n.hpp>
#include <range/v3/algorithm/swap_ranges.hpp>
#include <range/v3/algorithm/equal.hpp>
#include <range/v3/algorithm/lexicographical_compare.hpp>
#include <range/v3/utility/swap.hpp>
namespace test {
/// \addtogroup group-utility
/// A std::array with constexpr support
template<typename T, std::size_t N>
struct array
{
using self = array;
using value_type = T;
using reference = value_type&;
using const_reference = value_type const&;
using iterator = value_type*;
using const_iterator = value_type const*;
using pointer = value_type*;
using const_pointer = value_type const*;
using size_type = std::size_t;
using difference_type = std::ptrdiff_t;
using reverse_iterator = ranges::reverse_iterator<iterator>;
using const_reverse_iterator = ranges::reverse_iterator<const_iterator>;
value_type elems_[N > 0 ? N : 1];
constexpr /*c++14*/ void fill(const value_type& u)
{
ranges::fill_n(elems_, N, u);
}
constexpr /*c++14*/
void swap(array& a) noexcept(ranges::is_nothrow_swappable<T>::value)
{
ranges::swap_ranges(elems_, elems_ + N, a.elems_);
}
// iterators:
constexpr /*c++14*/
iterator begin() noexcept
{
return iterator(elems_);
}
constexpr /*c++14*/
const_iterator begin() const noexcept
{
return const_iterator(elems_);
}
constexpr /*c++14*/
iterator end() noexcept
{
return iterator(elems_ + N);
}
constexpr /*c++14*/
const_iterator end() const noexcept
{
return const_iterator(elems_ + N);
}
constexpr /*c++14*/
reverse_iterator rbegin() noexcept
{
return reverse_iterator(end());
}
constexpr /*c++14*/
const_reverse_iterator rbegin() const noexcept
{
return const_reverse_iterator(end());
}
constexpr /*c++14*/
reverse_iterator rend() noexcept
{
return reverse_iterator(begin());
}
constexpr /*c++14*/
const_reverse_iterator rend() const noexcept
{
return const_reverse_iterator(begin());
}
constexpr /*c++14*/
const_iterator cbegin() const noexcept
{
return begin();
}
constexpr /*c++14*/
const_iterator cend() const noexcept
{
return end();
}
constexpr /*c++14*/
const_reverse_iterator crbegin() const noexcept
{
return rbegin();
}
constexpr /*c++14*/
const_reverse_iterator crend() const noexcept
{
return rend();
}
// capacity:
constexpr /*c++14*/
size_type size() const noexcept
{
return N;
}
constexpr /*c++14*/
size_type max_size() const noexcept
{
return N;
}
constexpr /*c++14*/
bool empty() const noexcept
{
return N == 0;
}
// element access:
constexpr /*c++14*/ reference operator[](size_type n)
{
return elems_[n];
}
constexpr /*c++14*/ const_reference operator[](size_type n) const
{
return elems_[n];
}
constexpr /*c++14*/ reference at(size_type n)
{
if (n >= N)
throw std::out_of_range("array::at");
return elems_[n];
}
constexpr /*c++14*/ const_reference at(size_type n) const
{
if (n >= N)
throw std::out_of_range("array::at");
return elems_[n];
}
constexpr /*c++14*/ reference front()
{
return elems_[0];
}
constexpr /*c++14*/ const_reference front() const
{
return elems_[0];
}
constexpr /*c++14*/ reference back()
{
return elems_[N > 0 ? N-1 : 0];
}
constexpr /*c++14*/ const_reference back() const
{
return elems_[N > 0 ? N-1 : 0];
}
constexpr /*c++14*/
value_type* data() noexcept
{
return elems_;
}
constexpr /*c++14*/
const value_type* data() const noexcept
{
return elems_;
}
};
template<class T, size_t N>
constexpr /*c++14*/
bool
operator==(const array<T, N>& x, const array<T, N>& y)
{
return ranges::equal(x.elems_, x.elems_ + N, y.elems_);
}
template<class T, size_t N>
constexpr /*c++14*/
bool
operator!=(const array<T, N>& x, const array<T, N>& y)
{
return !(x == y);
}
template<class T, size_t N>
constexpr /*c++14*/
bool
operator<(const array<T, N>& x, const array<T, N>& y)
{
return ranges::lexicographical_compare(x.elems_, x.elems_ + N, y.elems_, y.elems_ + N);
}
template<class T, size_t N>
constexpr /*c++14*/
bool
operator>(const array<T, N>& x, const array<T, N>& y)
{
return y < x;
}
template<class T, size_t N>
constexpr /*c++14*/
bool
operator<=(const array<T, N>& x, const array<T, N>& y)
{
return !(y < x);
}
template<class T, size_t N>
constexpr /*c++14*/
bool
operator>=(const array<T, N>& x, const array<T, N>& y)
{
return !(x < y);
}
template<class T, size_t N>
constexpr /*c++14*/
auto swap(array<T, N>& x, array<T, N>& y)
noexcept(ranges::is_nothrow_swappable<T>::value)
-> typename std::enable_if<ranges::is_swappable<T>::value, void>::type
{
x.swap(y);
}
template<size_t I, class T, size_t N>
constexpr /*c++14*/
T& get(array<T, N>& a) noexcept
{
static_assert(I < N, "Index out of bounds in ranges::get<> (ranges::array)");
return a.elems_[I];
}
template<size_t I, class T, size_t N>
constexpr /*c++14*/
const T& get(const array<T, N>& a) noexcept
{
static_assert(I < N, "Index out of bounds in ranges::get<> (const ranges::array)");
return a.elems_[I];
}
template<size_t I, class T, size_t N>
constexpr /*c++14*/
T && get(array<T, N>&& a) noexcept
{
static_assert(I < N, "Index out of bounds in ranges::get<> (ranges::array &&)");
return std::move(a.elems_[I]);
}
template<class T, std::size_t N>
constexpr /*c++14*/ void swap(array<T, N>& a, array<T, N>& b) {
for(std::size_t i = 0; i != N; ++i) {
auto tmp = std::move(a[i]);
a[i] = std::move(b[i]);
b[i] = std::move(tmp);
}
}
} // namespace test
RANGES_DIAGNOSTIC_PUSH
RANGES_DIAGNOSTIC_IGNORE_MISMATCHED_TAGS
namespace std
{
template<class T, size_t N>
class tuple_size<test::array<T, N>>
: public integral_constant<size_t, N> {};
template<size_t I, class T, size_t N>
class tuple_element<I, test::array<T, N> >
{
public:
using type = T;
};
} // namespace std
RANGES_DIAGNOSTIC_POP
#endif // RANGES_V3_TEST_ARRAY_HPP
|
