30#define _GLIBCXX_ARRAY 1
33#pragma GCC system_header
36#if __cplusplus < 201103L
50#define __glibcxx_want_array_constexpr
51#define __glibcxx_want_freestanding_array
52#define __glibcxx_want_nonmember_container_access
53#define __glibcxx_want_to_array
56namespace std _GLIBCXX_VISIBILITY(default)
58_GLIBCXX_BEGIN_NAMESPACE_VERSION
60 template<
typename _Tp,
size_t _Nm>
63 using _Type = _Tp[_Nm];
64 using _Is_swappable = __is_swappable<_Tp>;
65 using _Is_nothrow_swappable = __is_nothrow_swappable<_Tp>;
68 template<
typename _Tp>
69 struct __array_traits<_Tp, 0>
75 __attribute__((__always_inline__,__noreturn__))
76 _Tp& operator[](
size_t)
const noexcept { __builtin_trap(); }
79 __attribute__((__always_inline__))
80 constexpr explicit operator _Tp*()
const noexcept {
return nullptr; }
101 template<
typename _Tp, std::
size_t _Nm>
104 typedef _Tp value_type;
105 typedef value_type* pointer;
106 typedef const value_type* const_pointer;
107 typedef value_type& reference;
108 typedef const value_type& const_reference;
109 typedef value_type* iterator;
110 typedef const value_type* const_iterator;
111 typedef std::size_t size_type;
112 typedef std::ptrdiff_t difference_type;
117 typename __array_traits<_Tp, _Nm>::_Type _M_elems;
122 _GLIBCXX20_CONSTEXPR
void
123 fill(
const value_type& __u)
124 { std::fill_n(begin(), size(), __u); }
126 _GLIBCXX20_CONSTEXPR
void
128 noexcept(__array_traits<_Tp, _Nm>::_Is_nothrow_swappable::value)
129 { std::swap_ranges(begin(), end(), __other.begin()); }
132 [[__gnu__::__const__, __nodiscard__]]
133 _GLIBCXX17_CONSTEXPR iterator
135 {
return iterator(data()); }
138 _GLIBCXX17_CONSTEXPR const_iterator
139 begin()
const noexcept
140 {
return const_iterator(data()); }
142 [[__gnu__::__const__, __nodiscard__]]
143 _GLIBCXX17_CONSTEXPR iterator
145 {
return iterator(data() + _Nm); }
148 _GLIBCXX17_CONSTEXPR const_iterator
150 {
return const_iterator(data() + _Nm); }
152 [[__gnu__::__const__, __nodiscard__]]
159 rbegin()
const noexcept
162 [[__gnu__::__const__, __nodiscard__]]
169 rend()
const noexcept
173 _GLIBCXX17_CONSTEXPR const_iterator
174 cbegin()
const noexcept
175 {
return const_iterator(data()); }
178 _GLIBCXX17_CONSTEXPR const_iterator
179 cend()
const noexcept
180 {
return const_iterator(data() + _Nm); }
184 crbegin()
const noexcept
189 crend()
const noexcept
193 [[__nodiscard__, __gnu__::__const__, __gnu__::__always_inline__]]
195 size()
const noexcept {
return _Nm; }
197 [[__nodiscard__, __gnu__::__const__, __gnu__::__always_inline__]]
199 max_size()
const noexcept {
return _Nm; }
201 [[__nodiscard__, __gnu__::__const__, __gnu__::__always_inline__]]
203 empty()
const noexcept {
return size() == 0; }
207 _GLIBCXX17_CONSTEXPR reference
208 operator[](size_type __n)
noexcept
210 __glibcxx_requires_subscript(__n);
211 return _M_elems[__n];
215 constexpr const_reference
216 operator[](size_type __n)
const noexcept
218#if __cplusplus >= 201402L
219 __glibcxx_requires_subscript(__n);
221 return _M_elems[__n];
224 _GLIBCXX17_CONSTEXPR reference
228 std::__throw_out_of_range_fmt(__N(
"array::at: __n (which is %zu) "
229 ">= _Nm (which is %zu)"),
231 return _M_elems[__n];
234 constexpr const_reference
235 at(size_type __n)
const
239 return __n < _Nm ? _M_elems[__n]
240 : (std::__throw_out_of_range_fmt(__N(
"array::at: __n (which is %zu) "
241 ">= _Nm (which is %zu)"),
247 _GLIBCXX17_CONSTEXPR reference
250 __glibcxx_requires_nonempty();
251 return _M_elems[(size_type)0];
255 constexpr const_reference
256 front()
const noexcept
258#if __cplusplus >= 201402L
259 __glibcxx_requires_nonempty();
261 return _M_elems[(size_type)0];
265 _GLIBCXX17_CONSTEXPR reference
268 __glibcxx_requires_nonempty();
269 return _M_elems[_Nm - 1];
273 constexpr const_reference
274 back()
const noexcept
276#if __cplusplus >= 201402L
277 __glibcxx_requires_nonempty();
279 return _M_elems[_Nm - 1];
282 [[__nodiscard__, __gnu__::__const__, __gnu__::__always_inline__]]
283 _GLIBCXX17_CONSTEXPR pointer
285 {
return static_cast<pointer
>(_M_elems); }
288 _GLIBCXX17_CONSTEXPR const_pointer
289 data()
const noexcept
290 {
return static_cast<const_pointer
>(_M_elems); }
293#if __cpp_deduction_guides >= 201606
294 template<
typename _Tp,
typename... _Up>
301 template<
typename _Tp, std::
size_t _Nm>
306 {
return std::equal(__one.begin(), __one.end(), __two.begin()); }
308#if __cpp_lib_three_way_comparison
309 template<
typename _Tp,
size_t _Nm>
311 constexpr __detail::__synth3way_t<_Tp>
312 operator<=>(
const array<_Tp, _Nm>& __a,
const array<_Tp, _Nm>& __b)
314 if constexpr (_Nm && __is_memcmp_ordered<_Tp>::__value)
315 if (!std::__is_constant_evaluated())
317 constexpr size_t __n = _Nm *
sizeof(_Tp);
318 return __builtin_memcmp(__a.data(), __b.data(), __n) <=> 0;
321 for (
size_t __i = 0; __i < _Nm; ++__i)
323 auto __c = __detail::__synth3way(__a[__i], __b[__i]);
327 return strong_ordering::equal;
330 template<
typename _Tp, std::
size_t _Nm>
334 operator!=(
const array<_Tp, _Nm>& __one,
const array<_Tp, _Nm>& __two)
335 {
return !(__one == __two); }
337 template<
typename _Tp, std::
size_t _Nm>
341 operator<(
const array<_Tp, _Nm>& __a,
const array<_Tp, _Nm>& __b)
343 return std::lexicographical_compare(__a.begin(), __a.end(),
344 __b.begin(), __b.end());
347 template<
typename _Tp, std::
size_t _Nm>
351 operator>(
const array<_Tp, _Nm>& __one,
const array<_Tp, _Nm>& __two)
352 {
return __two < __one; }
354 template<
typename _Tp, std::
size_t _Nm>
358 operator<=(
const array<_Tp, _Nm>& __one,
const array<_Tp, _Nm>& __two)
359 {
return !(__one > __two); }
361 template<
typename _Tp, std::
size_t _Nm>
365 operator>=(
const array<_Tp, _Nm>& __one,
const array<_Tp, _Nm>& __two)
366 {
return !(__one < __two); }
370 template<
typename _Tp, std::
size_t _Nm>
373#if __cplusplus > 201402L || !defined(__STRICT_ANSI__)
375 __enable_if_t<__array_traits<_Tp, _Nm>::_Is_swappable::value>
379 swap(array<_Tp, _Nm>& __one, array<_Tp, _Nm>& __two)
380 noexcept(
noexcept(__one.swap(__two)))
381 { __one.swap(__two); }
383#if __cplusplus > 201402L || !defined(__STRICT_ANSI__)
384 template<
typename _Tp, std::
size_t _Nm>
385 __enable_if_t<!__array_traits<_Tp, _Nm>::_Is_swappable::value>
386 swap(array<_Tp, _Nm>&, array<_Tp, _Nm>&) =
delete;
389 template<std::
size_t _Int,
typename _Tp, std::
size_t _Nm>
392 get(array<_Tp, _Nm>& __arr)
noexcept
394 static_assert(_Int < _Nm,
"array index is within bounds");
395 return __arr._M_elems[_Int];
398 template<std::
size_t _Int,
typename _Tp, std::
size_t _Nm>
401 get(array<_Tp, _Nm>&& __arr)
noexcept
403 static_assert(_Int < _Nm,
"array index is within bounds");
407 template<std::
size_t _Int,
typename _Tp, std::
size_t _Nm>
410 get(
const array<_Tp, _Nm>& __arr)
noexcept
412 static_assert(_Int < _Nm,
"array index is within bounds");
413 return __arr._M_elems[_Int];
416 template<std::
size_t _Int,
typename _Tp, std::
size_t _Nm>
418 constexpr const _Tp&&
419 get(
const array<_Tp, _Nm>&& __arr)
noexcept
421 static_assert(_Int < _Nm,
"array index is within bounds");
425#ifdef __cpp_lib_to_array
426 template<
typename _Tp,
size_t _Nm>
428 constexpr array<remove_cv_t<_Tp>, _Nm>
430 noexcept(is_nothrow_constructible_v<_Tp, _Tp&>)
432 static_assert(!is_array_v<_Tp>);
433 static_assert(is_constructible_v<_Tp, _Tp&>);
434 if constexpr (is_constructible_v<_Tp, _Tp&>)
436 if constexpr (is_trivially_copyable_v<_Tp>
437 && is_trivially_default_constructible_v<_Tp>
438 && is_copy_assignable_v<_Tp>)
440 array<remove_cv_t<_Tp>, _Nm> __arr;
441 if (!__is_constant_evaluated() && _Nm != 0)
442 __builtin_memcpy((
void*)__arr.data(), (
void*)__a,
sizeof(__a));
444 for (
size_t __i = 0; __i < _Nm; ++__i)
445 __arr._M_elems[__i] = __a[__i];
450 return array<remove_cv_t<_Tp>, _Nm>{{ __a[_Idx]... }};
451 }(make_index_sequence<_Nm>{});
454 __builtin_unreachable();
457 template<
typename _Tp,
size_t _Nm>
459 constexpr array<remove_cv_t<_Tp>, _Nm>
461 noexcept(is_nothrow_move_constructible_v<_Tp>)
463 static_assert(!is_array_v<_Tp>);
464 static_assert(is_move_constructible_v<_Tp>);
465 if constexpr (is_move_constructible_v<_Tp>)
467 if constexpr (is_trivially_copyable_v<_Tp>
468 && is_trivially_default_constructible_v<_Tp>
469 && is_copy_assignable_v<_Tp>)
471 array<remove_cv_t<_Tp>, _Nm> __arr;
472 if (!__is_constant_evaluated() && _Nm != 0)
473 __builtin_memcpy((
void*)__arr.data(), (
void*)__a,
sizeof(__a));
475 for (
size_t __i = 0; __i < _Nm; ++__i)
476 __arr._M_elems[__i] = __a[__i];
481 return array<remove_cv_t<_Tp>, _Nm>{{
std::move(__a[_Idx])... }};
482 }(make_index_sequence<_Nm>{});
485 __builtin_unreachable();
492 template<
typename _Tp,
size_t _Nm>
497 template<
size_t _Ind,
typename _Tp,
size_t _Nm>
500 static_assert(_Ind < _Nm,
"array index is in range");
504#if __cplusplus >= 201703L
505 template<
typename _Tp,
size_t _Nm>
506 inline constexpr size_t tuple_size_v<array<_Tp, _Nm>> = _Nm;
508 template<
typename _Tp,
size_t _Nm>
509 inline constexpr size_t tuple_size_v<const array<_Tp, _Nm>> = _Nm;
512 template<
typename _Tp,
size_t _Nm>
516_GLIBCXX_END_NAMESPACE_VERSION
constexpr bool operator<=(const duration< _Rep1, _Period1 > &__lhs, const duration< _Rep2, _Period2 > &__rhs)
constexpr bool operator>=(const duration< _Rep1, _Period1 > &__lhs, const duration< _Rep2, _Period2 > &__rhs)
constexpr bool operator<(const duration< _Rep1, _Period1 > &__lhs, const duration< _Rep2, _Period2 > &__rhs)
constexpr bool operator>(const duration< _Rep1, _Period1 > &__lhs, const duration< _Rep2, _Period2 > &__rhs)
__bool_constant< true > true_type
The type used as a compile-time boolean with true value.
typename enable_if< _Cond, _Tp >::type enable_if_t
Alias template for enable_if.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr array< remove_cv_t< _Tp >, _Nm > to_array(_Tp(&__a)[_Nm]) noexcept(is_nothrow_constructible< remove_cv_t< _Tp >, _Tp & >::value)
Create a std::array from an array.
ISO C++ entities toplevel namespace is std.
integer_sequence< size_t, _Idx... > index_sequence
Alias template index_sequence.
A standard container for storing a fixed size sequence of elements.
Finds the size of a given tuple type.
Gives the type of the ith element of a given tuple type.