// -*- C++ -*- //===---------------------------- array -----------------------------------===// // // 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 // //===----------------------------------------------------------------------===// #ifndef _LIBCUDACXX_ARRAY #define _LIBCUDACXX_ARRAY /* array synopsis namespace std { template struct array { // types: typedef T & reference; typedef const T & const_reference; typedef implementation defined iterator; typedef implementation defined const_iterator; typedef size_t size_type; typedef ptrdiff_t difference_type; typedef T value_type; typedef T* pointer; typedef const T* const_pointer; typedef std::reverse_iterator reverse_iterator; typedef std::reverse_iterator const_reverse_iterator; // No explicit construct/copy/destroy for aggregate type void fill(const T& u); void swap(array& a) noexcept(is_nothrow_swappable_v); // iterators: iterator begin() noexcept; const_iterator begin() const noexcept; iterator end() noexcept; const_iterator end() const noexcept; reverse_iterator rbegin() noexcept; const_reverse_iterator rbegin() const noexcept; reverse_iterator rend() noexcept; const_reverse_iterator rend() const noexcept; const_iterator cbegin() const noexcept; const_iterator cend() const noexcept; const_reverse_iterator crbegin() const noexcept; const_reverse_iterator crend() const noexcept; // capacity: constexpr size_type size() const noexcept; constexpr size_type max_size() const noexcept; constexpr bool empty() const noexcept; // element access: reference operator[](size_type n); const_reference operator[](size_type n) const; // constexpr in C++14 const_reference at(size_type n) const; // constexpr in C++14 reference at(size_type n); reference front(); const_reference front() const; // constexpr in C++14 reference back(); const_reference back() const; // constexpr in C++14 T* data() noexcept; const T* data() const noexcept; }; template array(T, U...) -> array; template bool operator==(const array& x, const array& y); template bool operator!=(const array& x, const array& y); template bool operator<(const array& x, const array& y); template bool operator>(const array& x, const array& y); template bool operator<=(const array& x, const array& y); template bool operator>=(const array& x, const array& y); template void swap(array& x, array& y) noexcept(noexcept(x.swap(y))); // C++17 template struct tuple_size; template struct tuple_element; template struct tuple_size>; template struct tuple_element>; template T& get(array&) noexcept; // constexpr in C++14 template const T& get(const array&) noexcept; // constexpr in C++14 template T&& get(array&&) noexcept; // constexpr in C++14 template const T&& get(const array&&) noexcept; // constexpr in C++14 } // std */ #ifndef __cuda_std__ #include <__config> #endif // __cuda_std__ #include "__algorithm/swap_ranges.h" #include "__assert" // all public C++ headers provide the assertion handler #include "__debug" #include "__iterator/reverse_iterator.h" #include "__tuple_dir/sfinae_helpers.h" #include "__tuple_dir/structured_bindings.h" #include "__type_traits/conditional.h" #include "__type_traits/enable_if.h" #include "__type_traits/is_const.h" #include "__type_traits/is_same.h" #include "__type_traits/is_swappable.h" #include "__utility/integer_sequence.h" #include "__utility/move.h" #include "__utility/unreachable.h" #include "algorithm" #include "cstdint" #include "cstdlib" #include "limits" #include "stdexcept" #include "type_traits" #include "version" // standard-mandated includes #include "version" // [iterator.range] #include "__iterator/access.h" #include "__iterator/data.h" #include "__iterator/empty.h" #include "__iterator/reverse_access.h" #include "__iterator/size.h" // [array.syn] #ifndef _LIBCUDACXX_HAS_NO_SPACESHIP_OPERATOR #include #endif #include "initializer_list" // [tuple.helper] #include "__tuple_dir/tuple_element.h" #include "__tuple_dir/tuple_size.h" #if defined(_CCCL_IMPLICIT_SYSTEM_HEADER_GCC) # pragma GCC system_header #elif defined(_CCCL_IMPLICIT_SYSTEM_HEADER_CLANG) # pragma clang system_header #elif defined(_CCCL_IMPLICIT_SYSTEM_HEADER_MSVC) # pragma system_header #endif // no system header _LIBCUDACXX_BEGIN_NAMESPACE_STD template struct _LIBCUDACXX_TEMPLATE_VIS array { // types: typedef array __self; typedef _Tp value_type; typedef value_type& reference; typedef const value_type& const_reference; typedef value_type* iterator; typedef const value_type* const_iterator; typedef value_type* pointer; typedef const value_type* const_pointer; typedef size_t size_type; typedef ptrdiff_t difference_type; typedef _CUDA_VSTD::reverse_iterator const_reverse_iterator; typedef _CUDA_VSTD::reverse_iterator reverse_iterator; _Tp __elems_[_Size]; // No explicit construct/copy/destroy for aggregate type _LIBCUDACXX_INLINE_VISIBILITY void fill(const value_type& __u) { _CUDA_VSTD::fill_n(__elems_, _Size, __u); } _LIBCUDACXX_INLINE_VISIBILITY void swap(array& __a) noexcept(__is_nothrow_swappable<_Tp>::value) { _CUDA_VSTD::swap_ranges(__elems_, __elems_ + _Size, __a.__elems_); } // iterators: _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 iterator begin() noexcept {return iterator(data());} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 const_iterator begin() const noexcept {return const_iterator(data());} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 iterator end() noexcept {return iterator(data() + _Size);} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 const_iterator end() const noexcept {return const_iterator(data() + _Size);} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 reverse_iterator rbegin() noexcept {return reverse_iterator(end());} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 const_reverse_iterator rbegin() const noexcept {return const_reverse_iterator(end());} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 reverse_iterator rend() noexcept {return reverse_iterator(begin());} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 const_reverse_iterator rend() const noexcept {return const_reverse_iterator(begin());} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 const_iterator cbegin() const noexcept {return begin();} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 const_iterator cend() const noexcept {return end();} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 const_reverse_iterator crbegin() const noexcept {return rbegin();} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 const_reverse_iterator crend() const noexcept {return rend();} // capacity: _LIBCUDACXX_INLINE_VISIBILITY constexpr size_type size() const noexcept {return _Size;} _LIBCUDACXX_INLINE_VISIBILITY constexpr size_type max_size() const noexcept {return _Size;} _LIBCUDACXX_NODISCARD_AFTER_CXX17 _LIBCUDACXX_INLINE_VISIBILITY constexpr bool empty() const noexcept {return false; } // element access: _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 reference operator[](size_type __n) noexcept {return __elems_[__n];} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 const_reference operator[](size_type __n) const noexcept {return __elems_[__n];} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 reference at(size_type __n); _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 const_reference at(size_type __n) const; _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 reference front() noexcept {return __elems_[0];} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 const_reference front() const noexcept {return __elems_[0];} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 reference back() noexcept {return __elems_[_Size - 1];} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 const_reference back() const noexcept {return __elems_[_Size - 1];} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 value_type* data() noexcept {return __elems_;} _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 const value_type* data() const noexcept {return __elems_;} }; template _LIBCUDACXX_CONSTEXPR_AFTER_CXX14 typename array<_Tp, _Size>::reference array<_Tp, _Size>::at(size_type __n) { if (__n >= _Size) __throw_out_of_range("array::at"); return __elems_[__n]; } template _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 typename array<_Tp, _Size>::const_reference array<_Tp, _Size>::at(size_type __n) const { if (__n >= _Size) __throw_out_of_range("array::at"); return __elems_[__n]; } template struct _LIBCUDACXX_TEMPLATE_VIS array<_Tp, 0> { // types: typedef array __self; typedef _Tp value_type; typedef value_type& reference; typedef const value_type& const_reference; typedef value_type* iterator; typedef const value_type* const_iterator; typedef value_type* pointer; typedef const value_type* const_pointer; typedef size_t size_type; typedef ptrdiff_t difference_type; typedef _CUDA_VSTD::reverse_iterator const_reverse_iterator; typedef _CUDA_VSTD::reverse_iterator reverse_iterator; typedef __conditional_t::value, const char, char> _CharType; struct _ArrayInStructT { _Tp __data_[1]; }; _ALIGNAS_TYPE(_ArrayInStructT) _CharType __elems_[sizeof(_ArrayInStructT)]; // No explicit construct/copy/destroy for aggregate type _LIBCUDACXX_INLINE_VISIBILITY void fill(const value_type&) { static_assert(!is_const<_Tp>::value, "cannot fill zero-sized array of type 'const T'"); } _LIBCUDACXX_INLINE_VISIBILITY void swap(array&) noexcept { static_assert(!is_const<_Tp>::value, "cannot swap zero-sized array of type 'const T'"); } // iterators: _LIBCUDACXX_INLINE_VISIBILITY iterator begin() noexcept {return iterator(data());} _LIBCUDACXX_INLINE_VISIBILITY const_iterator begin() const noexcept {return const_iterator(data());} _LIBCUDACXX_INLINE_VISIBILITY iterator end() noexcept {return iterator(data());} _LIBCUDACXX_INLINE_VISIBILITY const_iterator end() const noexcept {return const_iterator(data());} _LIBCUDACXX_INLINE_VISIBILITY reverse_iterator rbegin() noexcept {return reverse_iterator(end());} _LIBCUDACXX_INLINE_VISIBILITY const_reverse_iterator rbegin() const noexcept {return const_reverse_iterator(end());} _LIBCUDACXX_INLINE_VISIBILITY reverse_iterator rend() noexcept {return reverse_iterator(begin());} _LIBCUDACXX_INLINE_VISIBILITY const_reverse_iterator rend() const noexcept {return const_reverse_iterator(begin());} _LIBCUDACXX_INLINE_VISIBILITY const_iterator cbegin() const noexcept {return begin();} _LIBCUDACXX_INLINE_VISIBILITY const_iterator cend() const noexcept {return end();} _LIBCUDACXX_INLINE_VISIBILITY const_reverse_iterator crbegin() const noexcept {return rbegin();} _LIBCUDACXX_INLINE_VISIBILITY const_reverse_iterator crend() const noexcept {return rend();} // capacity: _LIBCUDACXX_INLINE_VISIBILITY constexpr size_type size() const noexcept {return 0; } _LIBCUDACXX_INLINE_VISIBILITY constexpr size_type max_size() const noexcept {return 0;} _LIBCUDACXX_NODISCARD_AFTER_CXX17 _LIBCUDACXX_INLINE_VISIBILITY constexpr bool empty() const noexcept {return true;} // element access: _LIBCUDACXX_INLINE_VISIBILITY reference operator[](size_type) noexcept { _LIBCUDACXX_ASSERT(false, "cannot call array::operator[] on a zero-sized array"); _LIBCUDACXX_UNREACHABLE(); } _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 const_reference operator[](size_type) const noexcept { _LIBCUDACXX_ASSERT(false, "cannot call array::operator[] on a zero-sized array"); _LIBCUDACXX_UNREACHABLE(); } _LIBCUDACXX_INLINE_VISIBILITY reference at(size_type) { __throw_out_of_range("array::at"); _LIBCUDACXX_UNREACHABLE(); } _LIBCUDACXX_INLINE_VISIBILITY const_reference at(size_type) const { __throw_out_of_range("array::at"); _LIBCUDACXX_UNREACHABLE(); } _LIBCUDACXX_INLINE_VISIBILITY reference front() noexcept { _LIBCUDACXX_ASSERT(false, "cannot call array::front() on a zero-sized array"); _LIBCUDACXX_UNREACHABLE(); } _LIBCUDACXX_INLINE_VISIBILITY const_reference front() const noexcept { _LIBCUDACXX_ASSERT(false, "cannot call array::front() on a zero-sized array"); _LIBCUDACXX_UNREACHABLE(); } _LIBCUDACXX_INLINE_VISIBILITY reference back() noexcept { _LIBCUDACXX_ASSERT(false, "cannot call array::back() on a zero-sized array"); _LIBCUDACXX_UNREACHABLE(); } _LIBCUDACXX_INLINE_VISIBILITY const_reference back() const noexcept { _LIBCUDACXX_ASSERT(false, "cannot call array::back() on a zero-sized array"); _LIBCUDACXX_UNREACHABLE(); } _LIBCUDACXX_INLINE_VISIBILITY value_type* data() noexcept {return reinterpret_cast(__elems_);} _LIBCUDACXX_INLINE_VISIBILITY const value_type* data() const noexcept {return reinterpret_cast(__elems_);} }; #ifndef _LIBCUDACXX_HAS_NO_DEDUCTION_GUIDES template && ...), void> > _LIBCUDACXX_HOST_DEVICE array(_Tp, _Args...) -> array<_Tp, 1 + sizeof...(_Args)>; #endif template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX17 bool operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { return _CUDA_VSTD::equal(__x.begin(), __x.end(), __y.begin()); } template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX17 bool operator!=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { return !(__x == __y); } template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX17 bool operator<(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { return _CUDA_VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); } template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX17 bool operator>(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { return __y < __x; } template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX17 bool operator<=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { return !(__y < __x); } template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX17 bool operator>=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { return !(__x < __y); } template inline _LIBCUDACXX_INLINE_VISIBILITY __enable_if_t < _Size == 0 || __is_swappable<_Tp>::value, void > swap(array<_Tp, _Size>& __x, array<_Tp, _Size>& __y) noexcept(noexcept(__x.swap(__y))) { __x.swap(__y); } template struct _LIBCUDACXX_TEMPLATE_VIS tuple_size > : public integral_constant {}; template struct _LIBCUDACXX_TEMPLATE_VIS tuple_element<_Ip, array<_Tp, _Size> > { static_assert(_Ip < _Size, "Index out of bounds in std::tuple_element<> (std::array)"); typedef _Tp type; }; template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 _Tp& get(array<_Tp, _Size>& __a) noexcept { static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array)"); return __a.__elems_[_Ip]; } template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 const _Tp& get(const array<_Tp, _Size>& __a) noexcept { static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array)"); return __a.__elems_[_Ip]; } template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 _Tp&& get(array<_Tp, _Size>&& __a) noexcept { static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array &&)"); return _CUDA_VSTD::move(__a.__elems_[_Ip]); } template inline _LIBCUDACXX_INLINE_VISIBILITY _LIBCUDACXX_CONSTEXPR_AFTER_CXX11 const _Tp&& get(const array<_Tp, _Size>&& __a) noexcept { static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array &&)"); return _CUDA_VSTD::move(__a.__elems_[_Ip]); } _LIBCUDACXX_END_NAMESPACE_STD #endif // _LIBCUDACXX_ARRAY