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> // all public C++ headers provide the assertion handler 120#include <__config> 121#include <__fwd/array.h> 122#include <__iterator/reverse_iterator.h> 123#include <__tuple/sfinae_helpers.h> 124#include <__type_traits/conditional.h> 125#include <__type_traits/is_array.h> 126#include <__type_traits/is_const.h> 127#include <__type_traits/is_constructible.h> 128#include <__type_traits/is_move_constructible.h> 129#include <__type_traits/is_nothrow_constructible.h> 130#include <__type_traits/is_nothrow_move_constructible.h> 131#include <__type_traits/is_same.h> 132#include <__type_traits/is_swappable.h> 133#include <__type_traits/remove_cv.h> 134#include <__utility/empty.h> 135#include <__utility/integer_sequence.h> 136#include <__utility/move.h> 137#include <__utility/unreachable.h> 138#include <stdexcept> 139#include <version> 140 141// standard-mandated includes 142 143// [iterator.range] 144#include <__iterator/access.h> 145#include <__iterator/data.h> 146#include <__iterator/empty.h> 147#include <__iterator/reverse_access.h> 148#include <__iterator/size.h> 149 150// [array.syn] 151#include <compare> 152#include <initializer_list> 153 154// [tuple.helper] 155#include <__tuple/tuple_element.h> 156#include <__tuple/tuple_size.h> 157 158#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 159# pragma GCC system_header 160#endif 161 162_LIBCPP_BEGIN_NAMESPACE_STD 163 164template <class _Tp, size_t _Size> 165struct _LIBCPP_TEMPLATE_VIS array 166{ 167 // types: 168 using __self = array; 169 using value_type = _Tp; 170 using reference = value_type&; 171 using const_reference = const value_type&; 172 using iterator = value_type*; 173 using const_iterator = const value_type*; 174 using pointer = value_type*; 175 using const_pointer = const value_type*; 176 using size_type = size_t; 177 using difference_type = ptrdiff_t; 178 using reverse_iterator = std::reverse_iterator<iterator>; 179 using const_reverse_iterator = std::reverse_iterator<const_iterator>; 180 181 _Tp __elems_[_Size]; 182 183 // No explicit construct/copy/destroy for aggregate type 184 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 185 void fill(const value_type& __u) { 186 std::fill_n(data(), _Size, __u); 187 } 188 189 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 190 void swap(array& __a) _NOEXCEPT_(__is_nothrow_swappable<_Tp>::value) { 191 std::swap_ranges(data(), data() + _Size, __a.data()); 192 } 193 194 // iterators: 195 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 196 iterator begin() _NOEXCEPT {return iterator(data());} 197 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 198 const_iterator begin() const _NOEXCEPT {return const_iterator(data());} 199 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 200 iterator end() _NOEXCEPT {return iterator(data() + _Size);} 201 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 202 const_iterator end() const _NOEXCEPT {return const_iterator(data() + _Size);} 203 204 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 205 reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());} 206 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 207 const_reverse_iterator rbegin() const _NOEXCEPT {return const_reverse_iterator(end());} 208 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 209 reverse_iterator rend() _NOEXCEPT {return reverse_iterator(begin());} 210 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 211 const_reverse_iterator rend() const _NOEXCEPT {return const_reverse_iterator(begin());} 212 213 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 214 const_iterator cbegin() const _NOEXCEPT {return begin();} 215 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 216 const_iterator cend() const _NOEXCEPT {return end();} 217 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 218 const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();} 219 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 220 const_reverse_iterator crend() const _NOEXCEPT {return rend();} 221 222 // capacity: 223 _LIBCPP_HIDE_FROM_ABI 224 _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT {return _Size;} 225 _LIBCPP_HIDE_FROM_ABI 226 _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT {return _Size;} 227 _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI 228 _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT {return _Size == 0;} 229 230 // element access: 231 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 232 reference operator[](size_type __n) _NOEXCEPT { 233 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__n < _Size, "out-of-bounds access in std::array<T, N>"); 234 return __elems_[__n]; 235 } 236 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 237 const_reference operator[](size_type __n) const _NOEXCEPT { 238 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__n < _Size, "out-of-bounds access in std::array<T, N>"); 239 return __elems_[__n]; 240 } 241 242 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference at(size_type __n) 243 { 244 if (__n >= _Size) 245 __throw_out_of_range("array::at"); 246 return __elems_[__n]; 247 } 248 249 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference at(size_type __n) const 250 { 251 if (__n >= _Size) 252 __throw_out_of_range("array::at"); 253 return __elems_[__n]; 254 } 255 256 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference front() _NOEXCEPT {return (*this)[0];} 257 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference front() const _NOEXCEPT {return (*this)[0];} 258 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference back() _NOEXCEPT {return (*this)[_Size - 1];} 259 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const_reference back() const _NOEXCEPT {return (*this)[_Size - 1];} 260 261 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 262 value_type* data() _NOEXCEPT {return __elems_;} 263 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 264 const value_type* data() const _NOEXCEPT {return __elems_;} 265}; 266 267template <class _Tp> 268struct _LIBCPP_TEMPLATE_VIS array<_Tp, 0> 269{ 270 // types: 271 typedef array __self; 272 typedef _Tp value_type; 273 typedef value_type& reference; 274 typedef const value_type& const_reference; 275 typedef value_type* iterator; 276 typedef const value_type* const_iterator; 277 typedef value_type* pointer; 278 typedef const value_type* const_pointer; 279 typedef size_t size_type; 280 typedef ptrdiff_t difference_type; 281 typedef std::reverse_iterator<iterator> reverse_iterator; 282 typedef std::reverse_iterator<const_iterator> const_reverse_iterator; 283 284 typedef __conditional_t<is_const<_Tp>::value, const __empty, __empty> _EmptyType; 285 286 struct _ArrayInStructT { _Tp __data_[1]; }; 287 _ALIGNAS_TYPE(_ArrayInStructT) _EmptyType __elems_[sizeof(_ArrayInStructT)]; 288 289 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 290 value_type* data() _NOEXCEPT {return nullptr;} 291 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 292 const value_type* data() const _NOEXCEPT {return nullptr;} 293 294 // No explicit construct/copy/destroy for aggregate type 295 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 296 void fill(const value_type&) { 297 static_assert(!is_const<_Tp>::value, 298 "cannot fill zero-sized array of type 'const T'"); 299 } 300 301 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 302 void swap(array&) _NOEXCEPT { 303 static_assert(!is_const<_Tp>::value, 304 "cannot swap zero-sized array of type 'const T'"); 305 } 306 307 // iterators: 308 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 309 iterator begin() _NOEXCEPT {return iterator(data());} 310 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 311 const_iterator begin() const _NOEXCEPT {return const_iterator(data());} 312 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 313 iterator end() _NOEXCEPT {return iterator(data());} 314 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 315 const_iterator end() const _NOEXCEPT {return const_iterator(data());} 316 317 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 318 reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());} 319 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 320 const_reverse_iterator rbegin() const _NOEXCEPT {return const_reverse_iterator(end());} 321 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 322 reverse_iterator rend() _NOEXCEPT {return reverse_iterator(begin());} 323 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 324 const_reverse_iterator rend() const _NOEXCEPT {return const_reverse_iterator(begin());} 325 326 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 327 const_iterator cbegin() const _NOEXCEPT {return begin();} 328 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 329 const_iterator cend() const _NOEXCEPT {return end();} 330 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 331 const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();} 332 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 333 const_reverse_iterator crend() const _NOEXCEPT {return rend();} 334 335 // capacity: 336 _LIBCPP_HIDE_FROM_ABI 337 _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT {return 0; } 338 _LIBCPP_HIDE_FROM_ABI 339 _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT {return 0;} 340 _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI 341 _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT {return true;} 342 343 // element access: 344 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 345 reference operator[](size_type) _NOEXCEPT { 346 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::operator[] on a zero-sized array"); 347 __libcpp_unreachable(); 348 } 349 350 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 351 const_reference operator[](size_type) const _NOEXCEPT { 352 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::operator[] on a zero-sized array"); 353 __libcpp_unreachable(); 354 } 355 356 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 357 reference at(size_type) { 358 __throw_out_of_range("array<T, 0>::at"); 359 __libcpp_unreachable(); 360 } 361 362 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 363 const_reference at(size_type) const { 364 __throw_out_of_range("array<T, 0>::at"); 365 __libcpp_unreachable(); 366 } 367 368 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 369 reference front() _NOEXCEPT { 370 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::front() on a zero-sized array"); 371 __libcpp_unreachable(); 372 } 373 374 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 375 const_reference front() const _NOEXCEPT { 376 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::front() on a zero-sized array"); 377 __libcpp_unreachable(); 378 } 379 380 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 381 reference back() _NOEXCEPT { 382 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::back() on a zero-sized array"); 383 __libcpp_unreachable(); 384 } 385 386 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 387 const_reference back() const _NOEXCEPT { 388 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(false, "cannot call array<T, 0>::back() on a zero-sized array"); 389 __libcpp_unreachable(); 390 } 391}; 392 393 394#if _LIBCPP_STD_VER >= 17 395template<class _Tp, class... _Args, 396 class = enable_if_t<__all<_IsSame<_Tp, _Args>::value...>::value> 397 > 398array(_Tp, _Args...) 399 -> array<_Tp, 1 + sizeof...(_Args)>; 400#endif 401 402template <class _Tp, size_t _Size> 403inline _LIBCPP_HIDE_FROM_ABI 404_LIBCPP_CONSTEXPR_SINCE_CXX20 bool 405operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) 406{ 407 return std::equal(__x.begin(), __x.end(), __y.begin()); 408} 409 410#if _LIBCPP_STD_VER <= 17 411 412template <class _Tp, size_t _Size> 413inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 414 return !(__x == __y); 415} 416 417template <class _Tp, size_t _Size> 418inline _LIBCPP_HIDE_FROM_ABI bool operator<(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 419 return std::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); 420} 421 422template <class _Tp, size_t _Size> 423inline _LIBCPP_HIDE_FROM_ABI bool operator>(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 424 return __y < __x; 425} 426 427template <class _Tp, size_t _Size> 428inline _LIBCPP_HIDE_FROM_ABI bool operator<=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 429 return !(__y < __x); 430} 431 432template <class _Tp, size_t _Size> 433inline _LIBCPP_HIDE_FROM_ABI bool operator>=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 434 return !(__x < __y); 435} 436 437#else // _LIBCPP_STD_VER <= 17 438 439template <class _Tp, size_t _Size> 440_LIBCPP_HIDE_FROM_ABI constexpr __synth_three_way_result<_Tp> 441operator<=>(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) { 442 return std::lexicographical_compare_three_way( 443 __x.begin(), __x.end(), __y.begin(), __y.end(), std::__synth_three_way<_Tp, _Tp>); 444} 445 446#endif // _LIBCPP_STD_VER <= 17 447 448template <class _Tp, size_t _Size, __enable_if_t<_Size == 0 || __is_swappable<_Tp>::value, int> = 0> 449inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 450void 451swap(array<_Tp, _Size>& __x, array<_Tp, _Size>& __y) 452 _NOEXCEPT_(noexcept(__x.swap(__y))) 453{ 454 __x.swap(__y); 455} 456 457template <class _Tp, size_t _Size> 458struct _LIBCPP_TEMPLATE_VIS tuple_size<array<_Tp, _Size> > 459 : public integral_constant<size_t, _Size> {}; 460 461template <size_t _Ip, class _Tp, size_t _Size> 462struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, array<_Tp, _Size> > 463{ 464 static_assert(_Ip < _Size, "Index out of bounds in std::tuple_element<> (std::array)"); 465 typedef _Tp type; 466}; 467 468template <size_t _Ip, class _Tp, size_t _Size> 469inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 470_Tp& 471get(array<_Tp, _Size>& __a) _NOEXCEPT 472{ 473 static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array)"); 474 return __a.__elems_[_Ip]; 475} 476 477template <size_t _Ip, class _Tp, size_t _Size> 478inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 479const _Tp& 480get(const array<_Tp, _Size>& __a) _NOEXCEPT 481{ 482 static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array)"); 483 return __a.__elems_[_Ip]; 484} 485 486template <size_t _Ip, class _Tp, size_t _Size> 487inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 488_Tp&& 489get(array<_Tp, _Size>&& __a) _NOEXCEPT 490{ 491 static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array &&)"); 492 return std::move(__a.__elems_[_Ip]); 493} 494 495template <size_t _Ip, class _Tp, size_t _Size> 496inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 497const _Tp&& 498get(const array<_Tp, _Size>&& __a) _NOEXCEPT 499{ 500 static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array &&)"); 501 return std::move(__a.__elems_[_Ip]); 502} 503 504#if _LIBCPP_STD_VER >= 20 505 506template <typename _Tp, size_t _Size, size_t... _Index> 507_LIBCPP_HIDE_FROM_ABI constexpr array<remove_cv_t<_Tp>, _Size> 508__to_array_lvalue_impl(_Tp (&__arr)[_Size], index_sequence<_Index...>) { 509 return {{__arr[_Index]...}}; 510} 511 512template <typename _Tp, size_t _Size, size_t... _Index> 513_LIBCPP_HIDE_FROM_ABI constexpr array<remove_cv_t<_Tp>, _Size> 514__to_array_rvalue_impl(_Tp(&&__arr)[_Size], index_sequence<_Index...>) { 515 return {{std::move(__arr[_Index])...}}; 516} 517 518template <typename _Tp, size_t _Size> 519_LIBCPP_HIDE_FROM_ABI constexpr array<remove_cv_t<_Tp>, _Size> 520to_array(_Tp (&__arr)[_Size]) noexcept(is_nothrow_constructible_v<_Tp, _Tp&>) { 521 static_assert( 522 !is_array_v<_Tp>, 523 "[array.creation]/1: to_array does not accept multidimensional arrays."); 524 static_assert( 525 is_constructible_v<_Tp, _Tp&>, 526 "[array.creation]/1: to_array requires copy constructible elements."); 527 return std::__to_array_lvalue_impl(__arr, make_index_sequence<_Size>()); 528} 529 530template <typename _Tp, size_t _Size> 531_LIBCPP_HIDE_FROM_ABI constexpr array<remove_cv_t<_Tp>, _Size> 532to_array(_Tp(&&__arr)[_Size]) noexcept(is_nothrow_move_constructible_v<_Tp>) { 533 static_assert( 534 !is_array_v<_Tp>, 535 "[array.creation]/4: to_array does not accept multidimensional arrays."); 536 static_assert( 537 is_move_constructible_v<_Tp>, 538 "[array.creation]/4: to_array requires move constructible elements."); 539 return std::__to_array_rvalue_impl(std::move(__arr), 540 make_index_sequence<_Size>()); 541} 542 543#endif // _LIBCPP_STD_VER >= 20 544 545_LIBCPP_END_NAMESPACE_STD 546 547#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20 548# include <algorithm> 549# include <concepts> 550# include <cstdlib> 551# include <iterator> 552# include <type_traits> 553# include <utility> 554#endif 555 556#endif // _LIBCPP_ARRAY 557