1// -*- C++ -*- 2//===----------------------------------------------------------------------===// 3// 4// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 5// See https://llvm.org/LICENSE.txt for license information. 6// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7// 8//===----------------------------------------------------------------------===// 9 10#ifndef _LIBCPP_ARRAY 11#define _LIBCPP_ARRAY 12 13/* 14 array synopsis 15 16namespace std 17{ 18template <class T, size_t N > 19struct array 20{ 21 // types: 22 typedef T & reference; 23 typedef const T & const_reference; 24 typedef implementation defined iterator; 25 typedef implementation defined const_iterator; 26 typedef size_t size_type; 27 typedef ptrdiff_t difference_type; 28 typedef T value_type; 29 typedef T* pointer; 30 typedef const T* const_pointer; 31 typedef std::reverse_iterator<iterator> reverse_iterator; 32 typedef std::reverse_iterator<const_iterator> const_reverse_iterator; 33 34 // No explicit construct/copy/destroy for aggregate type 35 void fill(const T& u); // constexpr in C++20 36 void swap(array& a) noexcept(is_nothrow_swappable_v<T>); // constexpr in C++20 37 38 // iterators: 39 iterator begin() noexcept; // constexpr in C++17 40 const_iterator begin() const noexcept; // constexpr in C++17 41 iterator end() noexcept; // constexpr in C++17 42 const_iterator end() const noexcept; // constexpr in C++17 43 44 reverse_iterator rbegin() noexcept; // constexpr in C++17 45 const_reverse_iterator rbegin() const noexcept; // constexpr in C++17 46 reverse_iterator rend() noexcept; // constexpr in C++17 47 const_reverse_iterator rend() const noexcept; // constexpr in C++17 48 49 const_iterator cbegin() const noexcept; // constexpr in C++17 50 const_iterator cend() const noexcept; // constexpr in C++17 51 const_reverse_iterator crbegin() const noexcept; // constexpr in C++17 52 const_reverse_iterator crend() const noexcept; // constexpr in C++17 53 54 // capacity: 55 constexpr size_type size() const noexcept; 56 constexpr size_type max_size() const noexcept; 57 constexpr bool empty() const noexcept; 58 59 // element access: 60 reference operator[](size_type n); // constexpr in C++17 61 const_reference operator[](size_type n) const; // constexpr in C++14 62 reference at(size_type n); // constexpr in C++17 63 const_reference at(size_type n) const; // constexpr in C++14 64 65 reference front(); // constexpr in C++17 66 const_reference front() const; // constexpr in C++14 67 reference back(); // constexpr in C++17 68 const_reference back() const; // constexpr in C++14 69 70 T* data() noexcept; // constexpr in C++17 71 const T* data() const noexcept; // constexpr in C++17 72}; 73 74template <class T, class... U> 75 array(T, U...) -> array<T, 1 + sizeof...(U)>; // C++17 76 77template <class T, size_t N> 78 bool operator==(const array<T,N>& x, const array<T,N>& y); // constexpr in C++20 79template <class T, size_t N> 80 bool operator!=(const array<T,N>& x, const array<T,N>& y); // removed in C++20 81template <class T, size_t N> 82 bool operator<(const array<T,N>& x, const array<T,N>& y); // removed in C++20 83template <class T, size_t N> 84 bool operator>(const array<T,N>& x, const array<T,N>& y); // removed in C++20 85template <class T, size_t N> 86 bool operator<=(const array<T,N>& x, const array<T,N>& y); // removed in C++20 87template <class T, size_t N> 88 bool operator>=(const array<T,N>& x, const array<T,N>& y); // removed in C++20 89template<class T, size_t N> 90 constexpr synth-three-way-result<T> 91 operator<=>(const array<T, N>& x, const array<T, N>& y); // since C++20 92 93template <class T, size_t N > 94 void swap(array<T,N>& x, array<T,N>& y) noexcept(noexcept(x.swap(y))); // constexpr in C++20 95 96template <class T, size_t N> 97 constexpr array<remove_cv_t<T>, N> to_array(T (&a)[N]); // C++20 98template <class T, size_t N> 99 constexpr array<remove_cv_t<T>, N> to_array(T (&&a)[N]); // C++20 100 101template <class T> struct tuple_size; 102template <size_t I, class T> struct tuple_element; 103template <class T, size_t N> struct tuple_size<array<T, N>>; 104template <size_t I, class T, size_t N> struct tuple_element<I, array<T, N>>; 105template <size_t I, class T, size_t N> T& get(array<T, N>&) noexcept; // constexpr in C++14 106template <size_t I, class T, size_t N> const T& get(const array<T, N>&) noexcept; // constexpr in C++14 107template <size_t I, class T, size_t N> T&& get(array<T, N>&&) noexcept; // constexpr in C++14 108template <size_t I, class T, size_t N> const T&& get(const array<T, N>&&) noexcept; // constexpr in C++14 109 110} // std 111 112*/ 113 114#include <__algorithm/equal.h> 115#include <__algorithm/fill_n.h> 116#include <__algorithm/lexicographical_compare.h> 117#include <__algorithm/lexicographical_compare_three_way.h> 118#include <__algorithm/swap_ranges.h> 119#include <__assert> 120#include <__config> 121#include <__fwd/array.h> 122#include <__iterator/reverse_iterator.h> 123#include <__iterator/wrap_iter.h> 124#include <__tuple/sfinae_helpers.h> 125#include <__type_traits/conditional.h> 126#include <__type_traits/is_array.h> 127#include <__type_traits/is_const.h> 128#include <__type_traits/is_constructible.h> 129#include <__type_traits/is_move_constructible.h> 130#include <__type_traits/is_nothrow_constructible.h> 131#include <__type_traits/is_nothrow_move_constructible.h> 132#include <__type_traits/is_same.h> 133#include <__type_traits/is_swappable.h> 134#include <__type_traits/remove_cv.h> 135#include <__utility/empty.h> 136#include <__utility/integer_sequence.h> 137#include <__utility/move.h> 138#include <__utility/unreachable.h> 139#include <stdexcept> 140#include <version> 141 142// standard-mandated includes 143 144// [iterator.range] 145#include <__iterator/access.h> 146#include <__iterator/data.h> 147#include <__iterator/empty.h> 148#include <__iterator/reverse_access.h> 149#include <__iterator/size.h> 150 151// [array.syn] 152#include <compare> 153#include <initializer_list> 154 155// [tuple.helper] 156#include <__tuple/tuple_element.h> 157#include <__tuple/tuple_size.h> 158 159#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 160# pragma GCC system_header 161#endif 162 163_LIBCPP_PUSH_MACROS 164#include <__undef_macros> 165 166_LIBCPP_BEGIN_NAMESPACE_STD 167 168template <class _Tp, size_t _Size> 169struct _LIBCPP_TEMPLATE_VIS array { 170 // types: 171 using __self = array; 172 using value_type = _Tp; 173 using reference = value_type&; 174 using const_reference = const value_type&; 175 using pointer = value_type*; 176 using const_pointer = const value_type*; 177#if defined(_LIBCPP_ABI_USE_WRAP_ITER_IN_STD_ARRAY) 178 using iterator = __wrap_iter<pointer>; 179 using const_iterator = __wrap_iter<const_pointer>; 180#else 181 using iterator = pointer; 182 using const_iterator = const_pointer; 183#endif 184 using size_type = size_t; 185 using difference_type = ptrdiff_t; 186 using reverse_iterator = std::reverse_iterator<iterator>; 187 using const_reverse_iterator = std::reverse_iterator<const_iterator>; 188 189 _Tp __elems_[_Size]; 190 191 // No explicit construct/copy/destroy for aggregate type 192 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void fill(const value_type& __u) { 193 std::fill_n(data(), _Size, __u); 194 } 195 196 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void swap(array& __a) 197 _NOEXCEPT_(__is_nothrow_swappable<_Tp>::value) { 198 std::swap_ranges(data(), data() + _Size, __a.data()); 199 } 200 201 // iterators: 202 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 iterator begin() _NOEXCEPT { return iterator(data()); } 203 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_iterator begin() const _NOEXCEPT { 204 return const_iterator(data()); 205 } 206 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 iterator end() _NOEXCEPT { return iterator(data() + _Size); } 207 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_iterator end() const _NOEXCEPT { 208 return const_iterator(data() + _Size); 209 } 210 211 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reverse_iterator rbegin() _NOEXCEPT { 212 return reverse_iterator(end()); 213 } 214 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_reverse_iterator rbegin() const _NOEXCEPT { 215 return const_reverse_iterator(end()); 216 } 217 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reverse_iterator rend() _NOEXCEPT { 218 return reverse_iterator(begin()); 219 } 220 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_reverse_iterator rend() const _NOEXCEPT { 221 return const_reverse_iterator(begin()); 222 } 223 224 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_iterator cbegin() const _NOEXCEPT { return begin(); } 225 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_iterator cend() const _NOEXCEPT { return end(); } 226 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_reverse_iterator crbegin() const _NOEXCEPT { 227 return rbegin(); 228 } 229 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_reverse_iterator crend() const _NOEXCEPT { return rend(); } 230 231 // capacity: 232 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT { return _Size; } 233 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT { return _Size; } 234 _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT { 235 return _Size == 0; 236 } 237 238 // element access: 239 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference operator[](size_type __n) _NOEXCEPT { 240 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__n < _Size, "out-of-bounds access in std::array<T, N>"); 241 return __elems_[__n]; 242 } 243 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference operator[](size_type __n) const _NOEXCEPT { 244 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__n < _Size, "out-of-bounds access in std::array<T, N>"); 245 return __elems_[__n]; 246 } 247 248 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference at(size_type __n) { 249 if (__n >= _Size) 250 __throw_out_of_range("array::at"); 251 return __elems_[__n]; 252 } 253 254 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference at(size_type __n) const { 255 if (__n >= _Size) 256 __throw_out_of_range("array::at"); 257 return __elems_[__n]; 258 } 259 260 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference front() _NOEXCEPT { return (*this)[0]; } 261 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference front() const _NOEXCEPT { return (*this)[0]; } 262 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference back() _NOEXCEPT { return (*this)[_Size - 1]; } 263 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference back() const _NOEXCEPT { 264 return (*this)[_Size - 1]; 265 } 266 267 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 value_type* data() _NOEXCEPT { return __elems_; } 268 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const value_type* data() const _NOEXCEPT { return __elems_; } 269}; 270 271template <class _Tp> 272struct _LIBCPP_TEMPLATE_VIS array<_Tp, 0> { 273 // types: 274 typedef array __self; 275 typedef _Tp value_type; 276 typedef value_type& reference; 277 typedef const value_type& const_reference; 278 typedef value_type* iterator; 279 typedef const value_type* const_iterator; 280 typedef value_type* pointer; 281 typedef const value_type* const_pointer; 282 typedef size_t size_type; 283 typedef ptrdiff_t difference_type; 284 typedef std::reverse_iterator<iterator> reverse_iterator; 285 typedef std::reverse_iterator<const_iterator> const_reverse_iterator; 286 287 typedef __conditional_t<is_const<_Tp>::value, const __empty, __empty> _EmptyType; 288 289 struct _ArrayInStructT { 290 _Tp __data_[1]; 291 }; 292 _ALIGNAS_TYPE(_ArrayInStructT) _EmptyType __elems_[sizeof(_ArrayInStructT)]; 293 294 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 value_type* data() _NOEXCEPT { return nullptr; } 295 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const value_type* data() const _NOEXCEPT { return nullptr; } 296 297 // No explicit construct/copy/destroy for aggregate type 298 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void fill(const value_type&) { 299 static_assert(!is_const<_Tp>::value, "cannot fill zero-sized array of type 'const T'"); 300 } 301 302 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void swap(array&) _NOEXCEPT { 303 static_assert(!is_const<_Tp>::value, "cannot swap zero-sized array of type 'const T'"); 304 } 305 306 // iterators: 307 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 iterator begin() _NOEXCEPT { return iterator(data()); } 308 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_iterator begin() const _NOEXCEPT { 309 return const_iterator(data()); 310 } 311 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 iterator end() _NOEXCEPT { return iterator(data()); } 312 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_iterator end() const _NOEXCEPT { 313 return const_iterator(data()); 314 } 315 316 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reverse_iterator rbegin() _NOEXCEPT { 317 return reverse_iterator(end()); 318 } 319 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_reverse_iterator rbegin() const _NOEXCEPT { 320 return const_reverse_iterator(end()); 321 } 322 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reverse_iterator rend() _NOEXCEPT { 323 return reverse_iterator(begin()); 324 } 325 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_reverse_iterator rend() const _NOEXCEPT { 326 return const_reverse_iterator(begin()); 327 } 328 329 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_iterator cbegin() const _NOEXCEPT { return begin(); } 330 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_iterator cend() const _NOEXCEPT { return end(); } 331 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_reverse_iterator crbegin() const _NOEXCEPT { 332 return rbegin(); 333 } 334 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 const_reverse_iterator crend() const _NOEXCEPT { return rend(); } 335 336 // capacity: 337 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT { return 0; } 338 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT { return 0; } 339 _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT { return true; } 340 341 // element access: 342 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference operator[](size_type) _NOEXCEPT { 343 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::operator[] on a zero-sized array"); 344 __libcpp_unreachable(); 345 } 346 347 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference operator[](size_type) const _NOEXCEPT { 348 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::operator[] on a zero-sized array"); 349 __libcpp_unreachable(); 350 } 351 352 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference at(size_type) { 353 __throw_out_of_range("array<T, 0>::at"); 354 __libcpp_unreachable(); 355 } 356 357 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference at(size_type) const { 358 __throw_out_of_range("array<T, 0>::at"); 359 __libcpp_unreachable(); 360 } 361 362 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference front() _NOEXCEPT { 363 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::front() on a zero-sized array"); 364 __libcpp_unreachable(); 365 } 366 367 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference front() const _NOEXCEPT { 368 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::front() on a zero-sized array"); 369 __libcpp_unreachable(); 370 } 371 372 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference back() _NOEXCEPT { 373 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::back() on a zero-sized array"); 374 __libcpp_unreachable(); 375 } 376 377 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference back() const _NOEXCEPT { 378 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::back() on a zero-sized array"); 379 __libcpp_unreachable(); 380 } 381}; 382 383#if _LIBCPP_STD_VER >= 17 384template <class _Tp, class... _Args, class = enable_if_t<__all<_IsSame<_Tp, _Args>::value...>::value> > 385array(_Tp, _Args...) -> array<_Tp, 1 + sizeof...(_Args)>; 386#endif 387 388template <class _Tp, size_t _Size> 389inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool 390operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 391 return std::equal(__x.begin(), __x.end(), __y.begin()); 392} 393 394#if _LIBCPP_STD_VER <= 17 395 396template <class _Tp, size_t _Size> 397inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 398 return !(__x == __y); 399} 400 401template <class _Tp, size_t _Size> 402inline _LIBCPP_HIDE_FROM_ABI bool operator<(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 403 return std::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); 404} 405 406template <class _Tp, size_t _Size> 407inline _LIBCPP_HIDE_FROM_ABI bool operator>(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 408 return __y < __x; 409} 410 411template <class _Tp, size_t _Size> 412inline _LIBCPP_HIDE_FROM_ABI bool operator<=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 413 return !(__y < __x); 414} 415 416template <class _Tp, size_t _Size> 417inline _LIBCPP_HIDE_FROM_ABI bool operator>=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 418 return !(__x < __y); 419} 420 421#else // _LIBCPP_STD_VER <= 17 422 423template <class _Tp, size_t _Size> 424_LIBCPP_HIDE_FROM_ABI constexpr __synth_three_way_result<_Tp> 425operator<=>(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 426 return std::lexicographical_compare_three_way( 427 __x.begin(), __x.end(), __y.begin(), __y.end(), std::__synth_three_way<_Tp, _Tp>); 428} 429 430#endif // _LIBCPP_STD_VER <= 17 431 432template <class _Tp, size_t _Size, __enable_if_t<_Size == 0 || __is_swappable<_Tp>::value, int> = 0> 433inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void swap(array<_Tp, _Size>& __x, array<_Tp, _Size>& __y) 434 _NOEXCEPT_(noexcept(__x.swap(__y))) { 435 __x.swap(__y); 436} 437 438template <class _Tp, size_t _Size> 439struct _LIBCPP_TEMPLATE_VIS tuple_size<array<_Tp, _Size> > : public integral_constant<size_t, _Size> {}; 440 441template <size_t _Ip, class _Tp, size_t _Size> 442struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, array<_Tp, _Size> > { 443 static_assert(_Ip < _Size, "Index out of bounds in std::tuple_element<> (std::array)"); 444 typedef _Tp type; 445}; 446 447template <size_t _Ip, class _Tp, size_t _Size> 448inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp& get(array<_Tp, _Size>& __a) _NOEXCEPT { 449 static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array)"); 450 return __a.__elems_[_Ip]; 451} 452 453template <size_t _Ip, class _Tp, size_t _Size> 454inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const _Tp& get(const array<_Tp, _Size>& __a) _NOEXCEPT { 455 static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array)"); 456 return __a.__elems_[_Ip]; 457} 458 459template <size_t _Ip, class _Tp, size_t _Size> 460inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp&& get(array<_Tp, _Size>&& __a) _NOEXCEPT { 461 static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array &&)"); 462 return std::move(__a.__elems_[_Ip]); 463} 464 465template <size_t _Ip, class _Tp, size_t _Size> 466inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const _Tp&& get(const array<_Tp, _Size>&& __a) _NOEXCEPT { 467 static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array &&)"); 468 return std::move(__a.__elems_[_Ip]); 469} 470 471#if _LIBCPP_STD_VER >= 20 472 473template <typename _Tp, size_t _Size, size_t... _Index> 474_LIBCPP_HIDE_FROM_ABI constexpr array<remove_cv_t<_Tp>, _Size> 475__to_array_lvalue_impl(_Tp (&__arr)[_Size], index_sequence<_Index...>) { 476 return {{__arr[_Index]...}}; 477} 478 479template <typename _Tp, size_t _Size, size_t... _Index> 480_LIBCPP_HIDE_FROM_ABI constexpr array<remove_cv_t<_Tp>, _Size> 481__to_array_rvalue_impl(_Tp (&&__arr)[_Size], index_sequence<_Index...>) { 482 return {{std::move(__arr[_Index])...}}; 483} 484 485template <typename _Tp, size_t _Size> 486_LIBCPP_HIDE_FROM_ABI constexpr array<remove_cv_t<_Tp>, _Size> 487to_array(_Tp (&__arr)[_Size]) noexcept(is_nothrow_constructible_v<_Tp, _Tp&>) { 488 static_assert(!is_array_v<_Tp>, "[array.creation]/1: to_array does not accept multidimensional arrays."); 489 static_assert(is_constructible_v<_Tp, _Tp&>, "[array.creation]/1: to_array requires copy constructible elements."); 490 return std::__to_array_lvalue_impl(__arr, make_index_sequence<_Size>()); 491} 492 493template <typename _Tp, size_t _Size> 494_LIBCPP_HIDE_FROM_ABI constexpr array<remove_cv_t<_Tp>, _Size> 495to_array(_Tp (&&__arr)[_Size]) noexcept(is_nothrow_move_constructible_v<_Tp>) { 496 static_assert(!is_array_v<_Tp>, "[array.creation]/4: to_array does not accept multidimensional arrays."); 497 static_assert(is_move_constructible_v<_Tp>, "[array.creation]/4: to_array requires move constructible elements."); 498 return std::__to_array_rvalue_impl(std::move(__arr), make_index_sequence<_Size>()); 499} 500 501#endif // _LIBCPP_STD_VER >= 20 502 503_LIBCPP_END_NAMESPACE_STD 504 505_LIBCPP_POP_MACROS 506 507#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20 508# include <algorithm> 509# include <concepts> 510# include <cstdlib> 511# include <iterator> 512# include <type_traits> 513# include <utility> 514#endif 515 516#endif // _LIBCPP_ARRAY 517