[thirdparty/gcc.git] / libstdc++-v3 / include / debug / array

// Debugging array implementation -*- C++ -*-

// Copyright (C) 2012-2019 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file debug/array
 *  This is a Standard C++ Library header.
 */

#ifndef _GLIBCXX_DEBUG_ARRAY
#define _GLIBCXX_DEBUG_ARRAY 1

#pragma GCC system_header

#include <array>

#include <debug/formatter.h>
#include <debug/macros.h>

namespace std _GLIBCXX_VISIBILITY(default)
{
namespace __debug
{
  template<typename _Tp, std::size_t _Nm>
    struct array
    {
      typedef _Tp 	    			      value_type;
      typedef value_type*			      pointer;
      typedef const value_type*                       const_pointer;
      typedef value_type&                   	      reference;
      typedef const value_type&             	      const_reference;
      typedef value_type*                             iterator;
      typedef const value_type*                       const_iterator;
      typedef std::size_t                    	      size_type;
      typedef std::ptrdiff_t                   	      difference_type;
      typedef std::reverse_iterator<iterator>	      reverse_iterator;
      typedef std::reverse_iterator<const_iterator>   const_reverse_iterator;

      // Support for zero-sized arrays mandatory.
      typedef _GLIBCXX_STD_C::__array_traits<_Tp, _Nm> _AT_Type;
      typename _AT_Type::_Type                         _M_elems;

      template<std::size_t _Size>
	struct _Array_check_subscript
 	{
	  std::size_t size() { return _Size; }

	  _Array_check_subscript(std::size_t __index)
	  { __glibcxx_check_subscript(__index); }
        };

      template<std::size_t _Size>
	struct _Array_check_nonempty
 	{
	  bool empty() { return _Size == 0; }

	  _Array_check_nonempty()
	  { __glibcxx_check_nonempty(); }
        };

      // No explicit construct/copy/destroy for aggregate type.

      // DR 776.
      void
      fill(const value_type& __u)
      { std::fill_n(begin(), size(), __u); }

      void
      swap(array& __other)
      noexcept(_AT_Type::_Is_nothrow_swappable::value)
      { std::swap_ranges(begin(), end(), __other.begin()); }

      // Iterators.
      _GLIBCXX17_CONSTEXPR iterator
      begin() noexcept
      { return iterator(data()); }

      _GLIBCXX17_CONSTEXPR const_iterator
      begin() const noexcept
      { return const_iterator(data()); }

      _GLIBCXX17_CONSTEXPR iterator
      end() noexcept
      { return iterator(data() + _Nm); }

      _GLIBCXX17_CONSTEXPR const_iterator
      end() const noexcept
      { return const_iterator(data() + _Nm); }

      _GLIBCXX17_CONSTEXPR reverse_iterator
      rbegin() noexcept
      { return reverse_iterator(end()); }

      _GLIBCXX17_CONSTEXPR const_reverse_iterator
      rbegin() const noexcept
      { return const_reverse_iterator(end()); }

      _GLIBCXX17_CONSTEXPR reverse_iterator
      rend() noexcept
      { return reverse_iterator(begin()); }

      _GLIBCXX17_CONSTEXPR const_reverse_iterator
      rend() const noexcept
      { return const_reverse_iterator(begin()); }

      _GLIBCXX17_CONSTEXPR const_iterator
      cbegin() const noexcept
      { return const_iterator(data()); }

      _GLIBCXX17_CONSTEXPR const_iterator
      cend() const noexcept
      { return const_iterator(data() + _Nm); }

      _GLIBCXX17_CONSTEXPR const_reverse_iterator
      crbegin() const noexcept
      { return const_reverse_iterator(end()); }

      _GLIBCXX17_CONSTEXPR const_reverse_iterator
      crend() const noexcept
      { return const_reverse_iterator(begin()); }

      // Capacity.
      constexpr size_type
      size() const noexcept { return _Nm; }

      constexpr size_type
      max_size() const noexcept { return _Nm; }

      constexpr bool
      empty() const noexcept { return size() == 0; }

      // Element access.
      _GLIBCXX17_CONSTEXPR reference
      operator[](size_type __n) noexcept
      {
	__glibcxx_check_subscript(__n);
	return _AT_Type::_S_ref(_M_elems, __n);
      }

      constexpr const_reference
      operator[](size_type __n) const noexcept
      {
	return __n < _Nm ? _AT_Type::_S_ref(_M_elems, __n)
	 : (_GLIBCXX_THROW_OR_ABORT(_Array_check_subscript<_Nm>(__n)),
	    _AT_Type::_S_ref(_M_elems, 0));
      }

      _GLIBCXX17_CONSTEXPR reference
      at(size_type __n)
      {
	if (__n >= _Nm)
	  std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
					    ">= _Nm (which is %zu)"),
					__n, _Nm);
	return _AT_Type::_S_ref(_M_elems, __n);
      }

      constexpr const_reference
      at(size_type __n) const
      {
	// Result of conditional expression must be an lvalue so use
	// boolean ? lvalue : (throw-expr, lvalue)
	return __n < _Nm ? _AT_Type::_S_ref(_M_elems, __n)
	  : (std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
					       ">= _Nm (which is %zu)"),
					   __n, _Nm),
	     _AT_Type::_S_ref(_M_elems, 0));
      }

      _GLIBCXX17_CONSTEXPR reference
      front() noexcept
      {
	__glibcxx_check_nonempty();
	return *begin();
      }

      constexpr const_reference
      front() const noexcept
      {
	return _Nm ? _AT_Type::_S_ref(_M_elems, 0)
	  : (_GLIBCXX_THROW_OR_ABORT(_Array_check_nonempty<_Nm>()),
	     _AT_Type::_S_ref(_M_elems, 0));
      }

      _GLIBCXX17_CONSTEXPR reference
      back() noexcept
      {
	__glibcxx_check_nonempty();
	return _Nm ? *(end() - 1) : *end();
      }

      constexpr const_reference
      back() const noexcept
      {
	return _Nm ? _AT_Type::_S_ref(_M_elems, _Nm - 1)
	  : (_GLIBCXX_THROW_OR_ABORT(_Array_check_nonempty<_Nm>()),
	     _AT_Type::_S_ref(_M_elems, 0));
      }

      _GLIBCXX17_CONSTEXPR pointer
      data() noexcept
      { return _AT_Type::_S_ptr(_M_elems); }

      _GLIBCXX17_CONSTEXPR const_pointer
      data() const noexcept
      { return _AT_Type::_S_ptr(_M_elems); }
    };

#if __cpp_deduction_guides >= 201606
  template<typename _Tp, typename... _Up>
    array(_Tp, _Up...)
      -> array<std::enable_if_t<(std::is_same_v<_Tp, _Up> && ...), _Tp>,
	       1 + sizeof...(_Up)>;
#endif

  // Array comparisons.
  template<typename _Tp, std::size_t _Nm>
    inline bool
    operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return std::equal(__one.begin(), __one.end(), __two.begin()); }

  template<typename _Tp, std::size_t _Nm>
    inline bool
    operator!=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return !(__one == __two); }

  template<typename _Tp, std::size_t _Nm>
    inline bool
    operator<(const array<_Tp, _Nm>& __a, const array<_Tp, _Nm>& __b)
    {
      return std::lexicographical_compare(__a.begin(), __a.end(),
					  __b.begin(), __b.end());
    }

  template<typename _Tp, std::size_t _Nm>
    inline bool
    operator>(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return __two < __one; }

  template<typename _Tp, std::size_t _Nm>
    inline bool
    operator<=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return !(__one > __two); }

  template<typename _Tp, std::size_t _Nm>
    inline bool
    operator>=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
    { return !(__one < __two); }

  // Specialized algorithms.

#if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11
  template<typename _Tp, size_t _Nm>
    typename enable_if<
      !_GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::_Is_swappable::value>::type
    swap(array<_Tp, _Nm>&, array<_Tp, _Nm>&) = delete;
#endif

  template<typename _Tp, std::size_t _Nm>
    inline void
    swap(array<_Tp, _Nm>& __one, array<_Tp, _Nm>& __two)
    noexcept(noexcept(__one.swap(__two)))
    { __one.swap(__two); }

  template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    constexpr _Tp&
    get(array<_Tp, _Nm>& __arr) noexcept
    {
      static_assert(_Int < _Nm, "index is out of bounds");
      return _GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::
	_S_ref(__arr._M_elems, _Int);
    }

  template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    constexpr _Tp&&
    get(array<_Tp, _Nm>&& __arr) noexcept
    {
      static_assert(_Int < _Nm, "index is out of bounds");
      return std::move(__debug::get<_Int>(__arr));
    }

  template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    constexpr const _Tp&
    get(const array<_Tp, _Nm>& __arr) noexcept
    {
      static_assert(_Int < _Nm, "index is out of bounds");
      return _GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::
	_S_ref(__arr._M_elems, _Int);
    }

  template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    constexpr const _Tp&&
    get(const array<_Tp, _Nm>&& __arr) noexcept
    {
      static_assert(_Int < _Nm, "index is out of bounds");
      return std::move(__debug::get<_Int>(__arr));
    }
} // namespace __debug

_GLIBCXX_BEGIN_NAMESPACE_VERSION
  // Tuple interface to class template array.

  /// tuple_size
  template<typename _Tp, std::size_t _Nm>
    struct tuple_size<std::__debug::array<_Tp, _Nm>>
    : public integral_constant<std::size_t, _Nm> { };

  /// tuple_element
  template<std::size_t _Int, typename _Tp, std::size_t _Nm>
    struct tuple_element<_Int, std::__debug::array<_Tp, _Nm>>
    {
      static_assert(_Int < _Nm, "index is out of bounds");
      typedef _Tp type;
    };

  template<typename _Tp, std::size_t _Nm>
    struct __is_tuple_like_impl<std::__debug::array<_Tp, _Nm>> : true_type
    { };

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif // _GLIBCXX_DEBUG_ARRAY
Commit	Line	Data
2c09be36	1	// Debugging array implementation -- C++ --
2c09be36	2
fbd26352	3	// Copyright (C) 2012-2019 Free Software Foundation, Inc.
2c09be36	4	//
	5	// This file is part of the GNU ISO C++ Library. This library is free
	6	// software; you can redistribute it and/or modify it under the
	7	// terms of the GNU General Public License as published by the
	8	// Free Software Foundation; either version 3, or (at your option)
	9	// any later version.
	10
	11	// This library is distributed in the hope that it will be useful,
	12	// but WITHOUT ANY WARRANTY; without even the implied warranty of
	13	// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	14	// GNU General Public License for more details.
	15
	16	// Under Section 7 of GPL version 3, you are granted additional
	17	// permissions described in the GCC Runtime Library Exception, version
	18	// 3.1, as published by the Free Software Foundation.
	19
	20	// You should have received a copy of the GNU General Public License and
	21	// a copy of the GCC Runtime Library Exception along with this program;
	22	// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
	23	// <http://www.gnu.org/licenses/>.
	24
	25	/** @file debug/array
	26	* This is a Standard C++ Library header.
	27	*/
	28
	29	#ifndef _GLIBCXX_DEBUG_ARRAY
	30	#define _GLIBCXX_DEBUG_ARRAY 1
	31
	32	#pragma GCC system_header
	33
a1d0f6e1	34	#include <array>
a1d0f6e1	35
e009b1d8	36	#include <debug/formatter.h>
e009b1d8	37	#include <debug/macros.h>
2c09be36	38
2c09be36	39	namespace std _GLIBCXX_VISIBILITY(default)
	40	{
	41	namespace __debug
	42	{
	43	template<typename _Tp, std::size_t _Nm>
	44	struct array
	45	{
	46	typedef _Tp value_type;
	47	typedef value_type* pointer;
	48	typedef const value_type* const_pointer;
	49	typedef value_type& reference;
	50	typedef const value_type& const_reference;
	51	typedef value_type* iterator;
	52	typedef const value_type* const_iterator;
	53	typedef std::size_t size_type;
	54	typedef std::ptrdiff_t difference_type;
	55	typedef std::reverse_iterator<iterator> reverse_iterator;
	56	typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
	57
	58	// Support for zero-sized arrays mandatory.
	59	typedef _GLIBCXX_STD_C::__array_traits<_Tp, _Nm> _AT_Type;
	60	typename _AT_Type::_Type _M_elems;
	61
	62	template<std::size_t _Size>
	63	struct _Array_check_subscript
	64	{
	65	std::size_t size() { return _Size; }
	66
	67	_Array_check_subscript(std::size_t __index)
	68	{ __glibcxx_check_subscript(__index); }
	69	};
	70
	71	template<std::size_t _Size>
	72	struct _Array_check_nonempty
	73	{
	74	bool empty() { return _Size == 0; }
	75
	76	_Array_check_nonempty()
	77	{ __glibcxx_check_nonempty(); }
	78	};
	79
	80	// No explicit construct/copy/destroy for aggregate type.
	81
	82	// DR 776.
	83	void
	84	fill(const value_type& __u)
	85	{ std::fill_n(begin(), size(), __u); }
	86
	87	void
	88	swap(array& __other)
d2e78ed5	89	noexcept(_AT_Type::_Is_nothrow_swappable::value)
2c09be36	90	{ std::swap_ranges(begin(), end(), __other.begin()); }
	91
	92	// Iterators.
629209c8	93	_GLIBCXX17_CONSTEXPR iterator
2c09be36	94	begin() noexcept
	95	{ return iterator(data()); }
	96
629209c8	97	_GLIBCXX17_CONSTEXPR const_iterator
2c09be36	98	begin() const noexcept
	99	{ return const_iterator(data()); }
	100
629209c8	101	_GLIBCXX17_CONSTEXPR iterator
2c09be36	102	end() noexcept
	103	{ return iterator(data() + _Nm); }
	104
629209c8	105	_GLIBCXX17_CONSTEXPR const_iterator
2c09be36	106	end() const noexcept
	107	{ return const_iterator(data() + _Nm); }
	108
629209c8	109	_GLIBCXX17_CONSTEXPR reverse_iterator
2c09be36	110	rbegin() noexcept
	111	{ return reverse_iterator(end()); }
	112
629209c8	113	_GLIBCXX17_CONSTEXPR const_reverse_iterator
2c09be36	114	rbegin() const noexcept
	115	{ return const_reverse_iterator(end()); }
	116
629209c8	117	_GLIBCXX17_CONSTEXPR reverse_iterator
2c09be36	118	rend() noexcept
	119	{ return reverse_iterator(begin()); }
	120
629209c8	121	_GLIBCXX17_CONSTEXPR const_reverse_iterator
2c09be36	122	rend() const noexcept
	123	{ return const_reverse_iterator(begin()); }
	124
629209c8	125	_GLIBCXX17_CONSTEXPR const_iterator
2c09be36	126	cbegin() const noexcept
	127	{ return const_iterator(data()); }
	128
629209c8	129	_GLIBCXX17_CONSTEXPR const_iterator
2c09be36	130	cend() const noexcept
	131	{ return const_iterator(data() + _Nm); }
	132
629209c8	133	_GLIBCXX17_CONSTEXPR const_reverse_iterator
2c09be36	134	crbegin() const noexcept
	135	{ return const_reverse_iterator(end()); }
	136
629209c8	137	_GLIBCXX17_CONSTEXPR const_reverse_iterator
2c09be36	138	crend() const noexcept
	139	{ return const_reverse_iterator(begin()); }
	140
	141	// Capacity.
629209c8	142	constexpr size_type
2c09be36	143	size() const noexcept { return _Nm; }
2c09be36	144
629209c8	145	constexpr size_type
2c09be36	146	max_size() const noexcept { return _Nm; }
2c09be36	147
629209c8	148	constexpr bool
2c09be36	149	empty() const noexcept { return size() == 0; }
	150
	151	// Element access.
629209c8	152	_GLIBCXX17_CONSTEXPR reference
c79d2ed3	153	operator[](size_type __n) noexcept
2c09be36	154	{
	155	__glibcxx_check_subscript(__n);
	156	return _AT_Type::_S_ref(_M_elems, __n);
	157	}
	158
	159	constexpr const_reference
	160	operator[](size_type __n) const noexcept
	161	{
	162	return __n < _Nm ? _AT_Type::_S_ref(_M_elems, __n)
1590c7d4	163	: (_GLIBCXX_THROW_OR_ABORT(_Array_check_subscript<_Nm>(__n)),
2c09be36	164	_AT_Type::_S_ref(_M_elems, 0));
	165	}
	166
629209c8	167	_GLIBCXX17_CONSTEXPR reference
2c09be36	168	at(size_type __n)
	169	{
	170	if (__n >= _Nm)
d2e78ed5	171	std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
d2e78ed5	172	">= _Nm (which is %zu)"),
b473f47f	173	__n, _Nm);
2c09be36	174	return _AT_Type::_S_ref(_M_elems, __n);
	175	}
	176
	177	constexpr const_reference
	178	at(size_type __n) const
	179	{
	180	// Result of conditional expression must be an lvalue so use
	181	// boolean ? lvalue : (throw-expr, lvalue)
	182	return __n < _Nm ? _AT_Type::_S_ref(_M_elems, __n)
b473f47f	183	: (std::__throw_out_of_range_fmt(__N("array::at: __n (which is %zu) "
	184	">= _Nm (which is %zu)"),
	185	__n, _Nm),
2c09be36	186	_AT_Type::_S_ref(_M_elems, 0));
	187	}
	188
629209c8	189	_GLIBCXX17_CONSTEXPR reference
c79d2ed3	190	front() noexcept
2c09be36	191	{
	192	__glibcxx_check_nonempty();
	193	return *begin();
	194	}
	195
629209c8	196	constexpr const_reference
c79d2ed3	197	front() const noexcept
2c09be36	198	{
2c09be36	199	return _Nm ? _AT_Type::_S_ref(_M_elems, 0)
1590c7d4	200	: (_GLIBCXX_THROW_OR_ABORT(_Array_check_nonempty<_Nm>()),
2c09be36	201	_AT_Type::_S_ref(_M_elems, 0));
	202	}
	203
629209c8	204	_GLIBCXX17_CONSTEXPR reference
c79d2ed3	205	back() noexcept
2c09be36	206	{
	207	__glibcxx_check_nonempty();
	208	return _Nm ? (end() - 1) : end();
	209	}
	210
629209c8	211	constexpr const_reference
c79d2ed3	212	back() const noexcept
2c09be36	213	{
2c09be36	214	return _Nm ? _AT_Type::_S_ref(_M_elems, _Nm - 1)
1590c7d4	215	: (_GLIBCXX_THROW_OR_ABORT(_Array_check_nonempty<_Nm>()),
2c09be36	216	_AT_Type::_S_ref(_M_elems, 0));
	217	}
	218
629209c8	219	_GLIBCXX17_CONSTEXPR pointer
2c09be36	220	data() noexcept
cbf558ec	221	{ return _AT_Type::_S_ptr(_M_elems); }
2c09be36	222
629209c8	223	_GLIBCXX17_CONSTEXPR const_pointer
2c09be36	224	data() const noexcept
cbf558ec	225	{ return _AT_Type::_S_ptr(_M_elems); }
2c09be36	226	};
2c09be36	227
43b0b3ac	228	#if __cpp_deduction_guides >= 201606
	229	template<typename _Tp, typename... _Up>
	230	array(_Tp, _Up...)
	231	-> array<std::enable_if_t<(std::is_same_v<_Tp, _Up> && ...), _Tp>,
	232	1 + sizeof...(_Up)>;
	233	#endif
	234
2c09be36	235	// Array comparisons.
2c09be36	236	template<typename _Tp, std::size_t _Nm>
629209c8	237	inline bool
2c09be36	238	operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
	239	{ return std::equal(__one.begin(), __one.end(), __two.begin()); }
	240
	241	template<typename _Tp, std::size_t _Nm>
	242	inline bool
	243	operator!=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
	244	{ return !(__one == __two); }
	245
	246	template<typename _Tp, std::size_t _Nm>
	247	inline bool
	248	operator<(const array<_Tp, _Nm>& __a, const array<_Tp, _Nm>& __b)
629209c8	249	{
2c09be36	250	return std::lexicographical_compare(__a.begin(), __a.end(),
629209c8	251	__b.begin(), __b.end());
2c09be36	252	}
	253
	254	template<typename _Tp, std::size_t _Nm>
	255	inline bool
	256	operator>(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
	257	{ return __two < __one; }
	258
	259	template<typename _Tp, std::size_t _Nm>
	260	inline bool
	261	operator<=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
	262	{ return !(__one > __two); }
	263
	264	template<typename _Tp, std::size_t _Nm>
	265	inline bool
	266	operator>=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
	267	{ return !(__one < __two); }
	268
	269	// Specialized algorithms.
0ef57848	270
	271	#if __cplusplus > 201402L \|\| !defined(__STRICT_ANSI__) // c++1z or gnu++11
	272	template<typename _Tp, size_t _Nm>
	273	typename enable_if<
	274	!_GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::_Is_swappable::value>::type
	275	swap(array<_Tp, _Nm>&, array<_Tp, _Nm>&) = delete;
	276	#endif
	277
2c09be36	278	template<typename _Tp, std::size_t _Nm>
	279	inline void
	280	swap(array<_Tp, _Nm>& __one, array<_Tp, _Nm>& __two)
	281	noexcept(noexcept(__one.swap(__two)))
	282	{ __one.swap(__two); }
	283
	284	template<std::size_t _Int, typename _Tp, std::size_t _Nm>
	285	constexpr _Tp&
	286	get(array<_Tp, _Nm>& __arr) noexcept
	287	{
	288	static_assert(_Int < _Nm, "index is out of bounds");
	289	return _GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::
	290	_S_ref(__arr._M_elems, _Int);
	291	}
	292
	293	template<std::size_t _Int, typename _Tp, std::size_t _Nm>
	294	constexpr _Tp&&
	295	get(array<_Tp, _Nm>&& __arr) noexcept
	296	{
	297	static_assert(_Int < _Nm, "index is out of bounds");
b49122a5	298	return std::move(__debug::get<_Int>(__arr));
2c09be36	299	}
	300
	301	template<std::size_t _Int, typename _Tp, std::size_t _Nm>
	302	constexpr const _Tp&
	303	get(const array<_Tp, _Nm>& __arr) noexcept
	304	{
	305	static_assert(_Int < _Nm, "index is out of bounds");
	306	return _GLIBCXX_STD_C::__array_traits<_Tp, _Nm>::
	307	_S_ref(__arr._M_elems, _Int);
	308	}
6d8efcd4	309
	310	template<std::size_t _Int, typename _Tp, std::size_t _Nm>
	311	constexpr const _Tp&&
	312	get(const array<_Tp, _Nm>&& __arr) noexcept
	313	{
	314	static_assert(_Int < _Nm, "index is out of bounds");
	315	return std::move(__debug::get<_Int>(__arr));
	316	}
2c09be36	317	} // namespace __debug
2c09be36	318
a1d0f6e1	319	_GLIBCXX_BEGIN_NAMESPACE_VERSION
2c09be36	320	// Tuple interface to class template array.
	321
	322	/// tuple_size
2c09be36	323	template<typename _Tp, std::size_t _Nm>
a1d0f6e1	324	struct tuple_size<std::__debug::array<_Tp, _Nm>>
2c09be36	325	: public integral_constant<std::size_t, _Nm> { };
	326
	327	/// tuple_element
2c09be36	328	template<std::size_t _Int, typename _Tp, std::size_t _Nm>
a1d0f6e1	329	struct tuple_element<_Int, std::__debug::array<_Tp, _Nm>>
2c09be36	330	{
	331	static_assert(_Int < _Nm, "index is out of bounds");
	332	typedef _Tp type;
	333	};
a1d0f6e1	334
	335	template<typename _Tp, std::size_t _Nm>
	336	struct __is_tuple_like_impl<std::__debug::array<_Tp, _Nm>> : true_type
	337	{ };
	338
	339	_GLIBCXX_END_NAMESPACE_VERSION
2c09be36	340	} // namespace std
2c09be36	341
2c09be36	342	#endif // _GLIBCXX_DEBUG_ARRAY