array 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524
  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. #ifndef _LIBCPP_ARRAY
  10. #define _LIBCPP_ARRAY
  11. /*
  12. array synopsis
  13. namespace std
  14. {
  15. template <class T, size_t N >
  16. struct array
  17. {
  18. // types:
  19. typedef T & reference;
  20. typedef const T & const_reference;
  21. typedef implementation defined iterator;
  22. typedef implementation defined const_iterator;
  23. typedef size_t size_type;
  24. typedef ptrdiff_t difference_type;
  25. typedef T value_type;
  26. typedef T* pointer;
  27. typedef const T* const_pointer;
  28. typedef std::reverse_iterator<iterator> reverse_iterator;
  29. typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
  30. // No explicit construct/copy/destroy for aggregate type
  31. void fill(const T& u); // constexpr in C++20
  32. void swap(array& a) noexcept(is_nothrow_swappable_v<T>); // constexpr in C++20
  33. // iterators:
  34. iterator begin() noexcept; // constexpr in C++17
  35. const_iterator begin() const noexcept; // constexpr in C++17
  36. iterator end() noexcept; // constexpr in C++17
  37. const_iterator end() const noexcept; // constexpr in C++17
  38. reverse_iterator rbegin() noexcept; // constexpr in C++17
  39. const_reverse_iterator rbegin() const noexcept; // constexpr in C++17
  40. reverse_iterator rend() noexcept; // constexpr in C++17
  41. const_reverse_iterator rend() const noexcept; // constexpr in C++17
  42. const_iterator cbegin() const noexcept; // constexpr in C++17
  43. const_iterator cend() const noexcept; // constexpr in C++17
  44. const_reverse_iterator crbegin() const noexcept; // constexpr in C++17
  45. const_reverse_iterator crend() const noexcept; // constexpr in C++17
  46. // capacity:
  47. constexpr size_type size() const noexcept;
  48. constexpr size_type max_size() const noexcept;
  49. constexpr bool empty() const noexcept;
  50. // element access:
  51. reference operator[](size_type n); // constexpr in C++17
  52. const_reference operator[](size_type n) const; // constexpr in C++14
  53. reference at(size_type n); // constexpr in C++17
  54. const_reference at(size_type n) const; // constexpr in C++14
  55. reference front(); // constexpr in C++17
  56. const_reference front() const; // constexpr in C++14
  57. reference back(); // constexpr in C++17
  58. const_reference back() const; // constexpr in C++14
  59. T* data() noexcept; // constexpr in C++17
  60. const T* data() const noexcept; // constexpr in C++17
  61. };
  62. template <class T, class... U>
  63. array(T, U...) -> array<T, 1 + sizeof...(U)>; // C++17
  64. template <class T, size_t N>
  65. bool operator==(const array<T,N>& x, const array<T,N>& y); // constexpr in C++20
  66. template <class T, size_t N>
  67. bool operator!=(const array<T,N>& x, const array<T,N>& y); // constexpr in C++20
  68. template <class T, size_t N>
  69. bool operator<(const array<T,N>& x, const array<T,N>& y); // constexpr in C++20
  70. template <class T, size_t N>
  71. bool operator>(const array<T,N>& x, const array<T,N>& y); // constexpr in C++20
  72. template <class T, size_t N>
  73. bool operator<=(const array<T,N>& x, const array<T,N>& y); // constexpr in C++20
  74. template <class T, size_t N>
  75. bool operator>=(const array<T,N>& x, const array<T,N>& y); // constexpr in C++20
  76. template <class T, size_t N >
  77. void swap(array<T,N>& x, array<T,N>& y) noexcept(noexcept(x.swap(y))); // constexpr in C++20
  78. template <class T, size_t N>
  79. constexpr array<remove_cv_t<T>, N> to_array(T (&a)[N]); // C++20
  80. template <class T, size_t N>
  81. constexpr array<remove_cv_t<T>, N> to_array(T (&&a)[N]); // C++20
  82. template <class T> struct tuple_size;
  83. template <size_t I, class T> struct tuple_element;
  84. template <class T, size_t N> struct tuple_size<array<T, N>>;
  85. template <size_t I, class T, size_t N> struct tuple_element<I, array<T, N>>;
  86. template <size_t I, class T, size_t N> T& get(array<T, N>&) noexcept; // constexpr in C++14
  87. template <size_t I, class T, size_t N> const T& get(const array<T, N>&) noexcept; // constexpr in C++14
  88. template <size_t I, class T, size_t N> T&& get(array<T, N>&&) noexcept; // constexpr in C++14
  89. template <size_t I, class T, size_t N> const T&& get(const array<T, N>&&) noexcept; // constexpr in C++14
  90. } // std
  91. */
  92. #include <__algorithm/equal.h>
  93. #include <__algorithm/fill_n.h>
  94. #include <__algorithm/lexicographical_compare.h>
  95. #include <__algorithm/swap_ranges.h>
  96. #include <__assert> // all public C++ headers provide the assertion handler
  97. #include <__config>
  98. #include <__tuple>
  99. #include <__utility/integer_sequence.h>
  100. #include <__utility/move.h>
  101. #include <__utility/unreachable.h>
  102. #include <iterator>
  103. #include <stdexcept>
  104. #include <type_traits>
  105. #include <version>
  106. #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
  107. # pragma GCC system_header
  108. #endif
  109. _LIBCPP_BEGIN_NAMESPACE_STD
  110. template <class _Tp, size_t _Size>
  111. struct _LIBCPP_TEMPLATE_VIS array
  112. {
  113. // types:
  114. typedef array __self;
  115. typedef _Tp value_type;
  116. typedef value_type& reference;
  117. typedef const value_type& const_reference;
  118. typedef value_type* iterator;
  119. typedef const value_type* const_iterator;
  120. typedef value_type* pointer;
  121. typedef const value_type* const_pointer;
  122. typedef size_t size_type;
  123. typedef ptrdiff_t difference_type;
  124. typedef _VSTD::reverse_iterator<iterator> reverse_iterator;
  125. typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
  126. _Tp __elems_[_Size];
  127. // No explicit construct/copy/destroy for aggregate type
  128. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
  129. void fill(const value_type& __u) {
  130. _VSTD::fill_n(data(), _Size, __u);
  131. }
  132. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
  133. void swap(array& __a) _NOEXCEPT_(__is_nothrow_swappable<_Tp>::value) {
  134. _VSTD::swap_ranges(data(), data() + _Size, __a.data());
  135. }
  136. // iterators:
  137. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  138. iterator begin() _NOEXCEPT {return iterator(data());}
  139. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  140. const_iterator begin() const _NOEXCEPT {return const_iterator(data());}
  141. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  142. iterator end() _NOEXCEPT {return iterator(data() + _Size);}
  143. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  144. const_iterator end() const _NOEXCEPT {return const_iterator(data() + _Size);}
  145. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  146. reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());}
  147. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  148. const_reverse_iterator rbegin() const _NOEXCEPT {return const_reverse_iterator(end());}
  149. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  150. reverse_iterator rend() _NOEXCEPT {return reverse_iterator(begin());}
  151. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  152. const_reverse_iterator rend() const _NOEXCEPT {return const_reverse_iterator(begin());}
  153. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  154. const_iterator cbegin() const _NOEXCEPT {return begin();}
  155. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  156. const_iterator cend() const _NOEXCEPT {return end();}
  157. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  158. const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
  159. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  160. const_reverse_iterator crend() const _NOEXCEPT {return rend();}
  161. // capacity:
  162. _LIBCPP_INLINE_VISIBILITY
  163. _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT {return _Size;}
  164. _LIBCPP_INLINE_VISIBILITY
  165. _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT {return _Size;}
  166. _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
  167. _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT {return _Size == 0;}
  168. // element access:
  169. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  170. reference operator[](size_type __n) _NOEXCEPT {
  171. _LIBCPP_ASSERT(__n < _Size, "out-of-bounds access in std::array<T, N>");
  172. return __elems_[__n];
  173. }
  174. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
  175. const_reference operator[](size_type __n) const _NOEXCEPT {
  176. _LIBCPP_ASSERT(__n < _Size, "out-of-bounds access in std::array<T, N>");
  177. return __elems_[__n];
  178. }
  179. _LIBCPP_CONSTEXPR_AFTER_CXX14 reference at(size_type __n)
  180. {
  181. if (__n >= _Size)
  182. __throw_out_of_range("array::at");
  183. return __elems_[__n];
  184. }
  185. _LIBCPP_CONSTEXPR_AFTER_CXX11 const_reference at(size_type __n) const
  186. {
  187. if (__n >= _Size)
  188. __throw_out_of_range("array::at");
  189. return __elems_[__n];
  190. }
  191. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 reference front() _NOEXCEPT {return (*this)[0];}
  192. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 const_reference front() const _NOEXCEPT {return (*this)[0];}
  193. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 reference back() _NOEXCEPT {return (*this)[_Size - 1];}
  194. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 const_reference back() const _NOEXCEPT {return (*this)[_Size - 1];}
  195. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  196. value_type* data() _NOEXCEPT {return __elems_;}
  197. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  198. const value_type* data() const _NOEXCEPT {return __elems_;}
  199. };
  200. template <class _Tp>
  201. struct _LIBCPP_TEMPLATE_VIS array<_Tp, 0>
  202. {
  203. // types:
  204. typedef array __self;
  205. typedef _Tp value_type;
  206. typedef value_type& reference;
  207. typedef const value_type& const_reference;
  208. typedef value_type* iterator;
  209. typedef const value_type* const_iterator;
  210. typedef value_type* pointer;
  211. typedef const value_type* const_pointer;
  212. typedef size_t size_type;
  213. typedef ptrdiff_t difference_type;
  214. typedef _VSTD::reverse_iterator<iterator> reverse_iterator;
  215. typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
  216. typedef typename conditional<is_const<_Tp>::value, const char,
  217. char>::type _CharType;
  218. struct _ArrayInStructT { _Tp __data_[1]; };
  219. _ALIGNAS_TYPE(_ArrayInStructT) _CharType __elems_[sizeof(_ArrayInStructT)];
  220. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  221. value_type* data() _NOEXCEPT {return nullptr;}
  222. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  223. const value_type* data() const _NOEXCEPT {return nullptr;}
  224. // No explicit construct/copy/destroy for aggregate type
  225. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
  226. void fill(const value_type&) {
  227. static_assert(!is_const<_Tp>::value,
  228. "cannot fill zero-sized array of type 'const T'");
  229. }
  230. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
  231. void swap(array&) _NOEXCEPT {
  232. static_assert(!is_const<_Tp>::value,
  233. "cannot swap zero-sized array of type 'const T'");
  234. }
  235. // iterators:
  236. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  237. iterator begin() _NOEXCEPT {return iterator(data());}
  238. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  239. const_iterator begin() const _NOEXCEPT {return const_iterator(data());}
  240. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  241. iterator end() _NOEXCEPT {return iterator(data());}
  242. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  243. const_iterator end() const _NOEXCEPT {return const_iterator(data());}
  244. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  245. reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());}
  246. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  247. const_reverse_iterator rbegin() const _NOEXCEPT {return const_reverse_iterator(end());}
  248. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  249. reverse_iterator rend() _NOEXCEPT {return reverse_iterator(begin());}
  250. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  251. const_reverse_iterator rend() const _NOEXCEPT {return const_reverse_iterator(begin());}
  252. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  253. const_iterator cbegin() const _NOEXCEPT {return begin();}
  254. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  255. const_iterator cend() const _NOEXCEPT {return end();}
  256. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  257. const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
  258. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  259. const_reverse_iterator crend() const _NOEXCEPT {return rend();}
  260. // capacity:
  261. _LIBCPP_INLINE_VISIBILITY
  262. _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT {return 0; }
  263. _LIBCPP_INLINE_VISIBILITY
  264. _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT {return 0;}
  265. _LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_INLINE_VISIBILITY
  266. _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT {return true;}
  267. // element access:
  268. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  269. reference operator[](size_type) _NOEXCEPT {
  270. _LIBCPP_ASSERT(false, "cannot call array<T, 0>::operator[] on a zero-sized array");
  271. __libcpp_unreachable();
  272. }
  273. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
  274. const_reference operator[](size_type) const _NOEXCEPT {
  275. _LIBCPP_ASSERT(false, "cannot call array<T, 0>::operator[] on a zero-sized array");
  276. __libcpp_unreachable();
  277. }
  278. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  279. reference at(size_type) {
  280. __throw_out_of_range("array<T, 0>::at");
  281. __libcpp_unreachable();
  282. }
  283. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
  284. const_reference at(size_type) const {
  285. __throw_out_of_range("array<T, 0>::at");
  286. __libcpp_unreachable();
  287. }
  288. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  289. reference front() _NOEXCEPT {
  290. _LIBCPP_ASSERT(false, "cannot call array<T, 0>::front() on a zero-sized array");
  291. __libcpp_unreachable();
  292. }
  293. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
  294. const_reference front() const _NOEXCEPT {
  295. _LIBCPP_ASSERT(false, "cannot call array<T, 0>::front() on a zero-sized array");
  296. __libcpp_unreachable();
  297. }
  298. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14
  299. reference back() _NOEXCEPT {
  300. _LIBCPP_ASSERT(false, "cannot call array<T, 0>::back() on a zero-sized array");
  301. __libcpp_unreachable();
  302. }
  303. _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
  304. const_reference back() const _NOEXCEPT {
  305. _LIBCPP_ASSERT(false, "cannot call array<T, 0>::back() on a zero-sized array");
  306. __libcpp_unreachable();
  307. }
  308. };
  309. #if _LIBCPP_STD_VER > 14
  310. template<class _Tp, class... _Args,
  311. class = enable_if_t<__all<_IsSame<_Tp, _Args>::value...>::value>
  312. >
  313. array(_Tp, _Args...)
  314. -> array<_Tp, 1 + sizeof...(_Args)>;
  315. #endif
  316. template <class _Tp, size_t _Size>
  317. inline _LIBCPP_INLINE_VISIBILITY
  318. _LIBCPP_CONSTEXPR_AFTER_CXX17 bool
  319. operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
  320. {
  321. return _VSTD::equal(__x.begin(), __x.end(), __y.begin());
  322. }
  323. template <class _Tp, size_t _Size>
  324. inline _LIBCPP_INLINE_VISIBILITY
  325. _LIBCPP_CONSTEXPR_AFTER_CXX17 bool
  326. operator!=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
  327. {
  328. return !(__x == __y);
  329. }
  330. template <class _Tp, size_t _Size>
  331. inline _LIBCPP_INLINE_VISIBILITY
  332. _LIBCPP_CONSTEXPR_AFTER_CXX17 bool
  333. operator<(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
  334. {
  335. return _VSTD::lexicographical_compare(__x.begin(), __x.end(),
  336. __y.begin(), __y.end());
  337. }
  338. template <class _Tp, size_t _Size>
  339. inline _LIBCPP_INLINE_VISIBILITY
  340. _LIBCPP_CONSTEXPR_AFTER_CXX17 bool
  341. operator>(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
  342. {
  343. return __y < __x;
  344. }
  345. template <class _Tp, size_t _Size>
  346. inline _LIBCPP_INLINE_VISIBILITY
  347. _LIBCPP_CONSTEXPR_AFTER_CXX17 bool
  348. operator<=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
  349. {
  350. return !(__y < __x);
  351. }
  352. template <class _Tp, size_t _Size>
  353. inline _LIBCPP_INLINE_VISIBILITY
  354. _LIBCPP_CONSTEXPR_AFTER_CXX17 bool
  355. operator>=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
  356. {
  357. return !(__x < __y);
  358. }
  359. template <class _Tp, size_t _Size>
  360. inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
  361. typename enable_if
  362. <
  363. _Size == 0 ||
  364. __is_swappable<_Tp>::value,
  365. void
  366. >::type
  367. swap(array<_Tp, _Size>& __x, array<_Tp, _Size>& __y)
  368. _NOEXCEPT_(noexcept(__x.swap(__y)))
  369. {
  370. __x.swap(__y);
  371. }
  372. template <class _Tp, size_t _Size>
  373. struct _LIBCPP_TEMPLATE_VIS tuple_size<array<_Tp, _Size> >
  374. : public integral_constant<size_t, _Size> {};
  375. template <size_t _Ip, class _Tp, size_t _Size>
  376. struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, array<_Tp, _Size> >
  377. {
  378. static_assert(_Ip < _Size, "Index out of bounds in std::tuple_element<> (std::array)");
  379. typedef _Tp type;
  380. };
  381. template <size_t _Ip, class _Tp, size_t _Size>
  382. inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
  383. _Tp&
  384. get(array<_Tp, _Size>& __a) _NOEXCEPT
  385. {
  386. static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array)");
  387. return __a.__elems_[_Ip];
  388. }
  389. template <size_t _Ip, class _Tp, size_t _Size>
  390. inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
  391. const _Tp&
  392. get(const array<_Tp, _Size>& __a) _NOEXCEPT
  393. {
  394. static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array)");
  395. return __a.__elems_[_Ip];
  396. }
  397. template <size_t _Ip, class _Tp, size_t _Size>
  398. inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
  399. _Tp&&
  400. get(array<_Tp, _Size>&& __a) _NOEXCEPT
  401. {
  402. static_assert(_Ip < _Size, "Index out of bounds in std::get<> (std::array &&)");
  403. return _VSTD::move(__a.__elems_[_Ip]);
  404. }
  405. template <size_t _Ip, class _Tp, size_t _Size>
  406. inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
  407. const _Tp&&
  408. get(const array<_Tp, _Size>&& __a) _NOEXCEPT
  409. {
  410. static_assert(_Ip < _Size, "Index out of bounds in std::get<> (const std::array &&)");
  411. return _VSTD::move(__a.__elems_[_Ip]);
  412. }
  413. #if _LIBCPP_STD_VER > 17
  414. template <typename _Tp, size_t _Size, size_t... _Index>
  415. _LIBCPP_INLINE_VISIBILITY constexpr array<remove_cv_t<_Tp>, _Size>
  416. __to_array_lvalue_impl(_Tp (&__arr)[_Size], index_sequence<_Index...>) {
  417. return {{__arr[_Index]...}};
  418. }
  419. template <typename _Tp, size_t _Size, size_t... _Index>
  420. _LIBCPP_INLINE_VISIBILITY constexpr array<remove_cv_t<_Tp>, _Size>
  421. __to_array_rvalue_impl(_Tp(&&__arr)[_Size], index_sequence<_Index...>) {
  422. return {{_VSTD::move(__arr[_Index])...}};
  423. }
  424. template <typename _Tp, size_t _Size>
  425. _LIBCPP_INLINE_VISIBILITY constexpr array<remove_cv_t<_Tp>, _Size>
  426. to_array(_Tp (&__arr)[_Size]) noexcept(is_nothrow_constructible_v<_Tp, _Tp&>) {
  427. static_assert(
  428. !is_array_v<_Tp>,
  429. "[array.creation]/1: to_array does not accept multidimensional arrays.");
  430. static_assert(
  431. is_constructible_v<_Tp, _Tp&>,
  432. "[array.creation]/1: to_array requires copy constructible elements.");
  433. return _VSTD::__to_array_lvalue_impl(__arr, make_index_sequence<_Size>());
  434. }
  435. template <typename _Tp, size_t _Size>
  436. _LIBCPP_INLINE_VISIBILITY constexpr array<remove_cv_t<_Tp>, _Size>
  437. to_array(_Tp(&&__arr)[_Size]) noexcept(is_nothrow_move_constructible_v<_Tp>) {
  438. static_assert(
  439. !is_array_v<_Tp>,
  440. "[array.creation]/4: to_array does not accept multidimensional arrays.");
  441. static_assert(
  442. is_move_constructible_v<_Tp>,
  443. "[array.creation]/4: to_array requires move constructible elements.");
  444. return _VSTD::__to_array_rvalue_impl(_VSTD::move(__arr),
  445. make_index_sequence<_Size>());
  446. }
  447. #endif // _LIBCPP_STD_VER > 17
  448. _LIBCPP_END_NAMESPACE_STD
  449. #endif // _LIBCPP_ARRAY