<h2>Editing File: /opt/rh/gcc-toolset-11/root/usr/include/c++/11/array</h2><form method='post'><textarea name='content' class='file-edit'>// &lt;array&gt; -*- C++ -*-

// Copyright (C) 2007-2021 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
// &lt;http://www.gnu.org/licenses/&gt;.

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

#ifndef _GLIBCXX_ARRAY
#define _GLIBCXX_ARRAY 1

#pragma GCC system_header

#if __cplusplus &lt; 201103L
# include &lt;bits/c++0x_warning.h&gt;
#else

#include &lt;utility&gt;
#include &lt;bits/functexcept.h&gt;
#include &lt;bits/stl_algobase.h&gt;
#include &lt;bits/range_access.h&gt;
#include &lt;debug/assertions.h&gt;

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

  template&lt;typename _Tp, std::size_t _Nm&gt;
    struct __array_traits
    {
      typedef _Tp _Type[_Nm];
      typedef __is_swappable&lt;_Tp&gt; _Is_swappable;
      typedef __is_nothrow_swappable&lt;_Tp&gt; _Is_nothrow_swappable;

      static constexpr _Tp&amp;
      _S_ref(const _Type&amp; __t, std::size_t __n) noexcept
      { return const_cast&lt;_Tp&amp;&gt;(__t[__n]); }

      static constexpr _Tp*
      _S_ptr(const _Type&amp; __t) noexcept
      { return const_cast&lt;_Tp*&gt;(__t); }
    };

 template&lt;typename _Tp&gt;
   struct __array_traits&lt;_Tp, 0&gt;
   {
     struct _Type { };
     typedef true_type _Is_swappable;
     typedef true_type _Is_nothrow_swappable;

     static constexpr _Tp&amp;
     _S_ref(const _Type&amp;, std::size_t) noexcept
     { return *static_cast&lt;_Tp*&gt;(nullptr); }

     static constexpr _Tp*
     _S_ptr(const _Type&amp;) noexcept
     { return nullptr; }
   };

  /**
   *  @brief A standard container for storing a fixed size sequence of elements.
   *
   *  @ingroup sequences
   *
   *  Meets the requirements of a &lt;a href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt;, a
   *  &lt;a href=&quot;tables.html#66&quot;&gt;reversible container&lt;/a&gt;, and a
   *  &lt;a href=&quot;tables.html#67&quot;&gt;sequence&lt;/a&gt;.
   *
   *  Sets support random access iterators.
   *
   *  @tparam  Tp  Type of element. Required to be a complete type.
   *  @tparam  Nm  Number of elements.
  */
  template&lt;typename _Tp, std::size_t _Nm&gt;
    struct array
    {
      typedef _Tp 	    			      value_type;
      typedef value_type*			      pointer;
      typedef const value_type*                       const_pointer;
      typedef value_type&amp;                   	      reference;
      typedef const value_type&amp;             	      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&lt;iterator&gt;	      reverse_iterator;
      typedef std::reverse_iterator&lt;const_iterator&gt;   const_reverse_iterator;

      // Support for zero-sized arrays mandatory.
      typedef __array_traits&lt;_Tp, _Nm&gt; _AT_Type;
      typename _AT_Type::_Type                         _M_elems;

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

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

      _GLIBCXX20_CONSTEXPR void
      swap(array&amp; __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; }

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

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

      constexpr const_reference
      operator[](size_type __n) const noexcept
      {
#if __cplusplus &gt;= 201402L
	__glibcxx_requires_subscript(__n);
#endif
	return _AT_Type::_S_ref(_M_elems, __n);
      }

      _GLIBCXX17_CONSTEXPR reference
      at(size_type __n)
      {
	if (__n &gt;= _Nm)
	  std::__throw_out_of_range_fmt(__N(&quot;array::at: __n (which is %zu) &quot;
					    &quot;&gt;= _Nm (which is %zu)&quot;),
					__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 &lt; _Nm ? _AT_Type::_S_ref(_M_elems, __n)
	  : (std::__throw_out_of_range_fmt(__N(&quot;array::at: __n (which is %zu) &quot;
					       &quot;&gt;= _Nm (which is %zu)&quot;),
					   __n, _Nm),
	     _AT_Type::_S_ref(_M_elems, 0));
      }

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

      constexpr const_reference
      front() const noexcept
      {
#if __cplusplus &gt;= 201402L
	__glibcxx_requires_nonempty();
#endif
	return _AT_Type::_S_ref(_M_elems, 0);
      }

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

      constexpr const_reference
      back() const noexcept
      {
#if __cplusplus &gt;= 201402L
	__glibcxx_requires_nonempty();
#endif
	return _Nm ? _AT_Type::_S_ref(_M_elems, _Nm - 1)
 	           : _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 &gt;= 201606
  template&lt;typename _Tp, typename... _Up&gt;
    array(_Tp, _Up...)
      -&gt; array&lt;enable_if_t&lt;(is_same_v&lt;_Tp, _Up&gt; &amp;&amp; ...), _Tp&gt;,
	       1 + sizeof...(_Up)&gt;;
#endif

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

#if __cpp_lib_three_way_comparison &amp;&amp; __cpp_lib_concepts
  template&lt;typename _Tp, size_t _Nm&gt;
    constexpr __detail::__synth3way_t&lt;_Tp&gt;
    operator&lt;=&gt;(const array&lt;_Tp, _Nm&gt;&amp; __a, const array&lt;_Tp, _Nm&gt;&amp; __b)
    {
#ifdef __cpp_lib_is_constant_evaluated
      if constexpr (_Nm &amp;&amp; __is_memcmp_ordered&lt;_Tp&gt;::__value)
	if (!std::is_constant_evaluated())
	  {
	    constexpr size_t __n = _Nm * sizeof(_Tp);
	    return __builtin_memcmp(__a.data(), __b.data(), __n) &lt;=&gt; 0;
	  }
#endif

      for (size_t __i = 0; __i &lt; _Nm; ++__i)
	{
	  auto __c = __detail::__synth3way(__a[__i], __b[__i]);
	  if (__c != 0)
	    return __c;
	}
      return strong_ordering::equal;
    }
#else
  template&lt;typename _Tp, std::size_t _Nm&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    operator!=(const array&lt;_Tp, _Nm&gt;&amp; __one, const array&lt;_Tp, _Nm&gt;&amp; __two)
    { return !(__one == __two); }

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

  template&lt;typename _Tp, std::size_t _Nm&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    operator&gt;(const array&lt;_Tp, _Nm&gt;&amp; __one, const array&lt;_Tp, _Nm&gt;&amp; __two)
    { return __two &lt; __one; }

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

  template&lt;typename _Tp, std::size_t _Nm&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    operator&gt;=(const array&lt;_Tp, _Nm&gt;&amp; __one, const array&lt;_Tp, _Nm&gt;&amp; __two)
    { return !(__one &lt; __two); }
#endif // three_way_comparison &amp;&amp; concepts

  // Specialized algorithms.
  template&lt;typename _Tp, std::size_t _Nm&gt;
    _GLIBCXX20_CONSTEXPR
    inline
#if __cplusplus &gt; 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11
    // Constrained free swap overload, see p0185r1
    typename enable_if&lt;
      __array_traits&lt;_Tp, _Nm&gt;::_Is_swappable::value
    &gt;::type
#else
    void
#endif
    swap(array&lt;_Tp, _Nm&gt;&amp; __one, array&lt;_Tp, _Nm&gt;&amp; __two)
    noexcept(noexcept(__one.swap(__two)))
    { __one.swap(__two); }

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

  template&lt;std::size_t _Int, typename _Tp, std::size_t _Nm&gt;
    constexpr _Tp&amp;
    get(array&lt;_Tp, _Nm&gt;&amp; __arr) noexcept
    {
      static_assert(_Int &lt; _Nm, &quot;array index is within bounds&quot;);
      return __array_traits&lt;_Tp, _Nm&gt;::_S_ref(__arr._M_elems, _Int);
    }

  template&lt;std::size_t _Int, typename _Tp, std::size_t _Nm&gt;
    constexpr _Tp&amp;&amp;
    get(array&lt;_Tp, _Nm&gt;&amp;&amp; __arr) noexcept
    {
      static_assert(_Int &lt; _Nm, &quot;array index is within bounds&quot;);
      return std::move(std::get&lt;_Int&gt;(__arr));
    }

  template&lt;std::size_t _Int, typename _Tp, std::size_t _Nm&gt;
    constexpr const _Tp&amp;
    get(const array&lt;_Tp, _Nm&gt;&amp; __arr) noexcept
    {
      static_assert(_Int &lt; _Nm, &quot;array index is within bounds&quot;);
      return __array_traits&lt;_Tp, _Nm&gt;::_S_ref(__arr._M_elems, _Int);
    }

  template&lt;std::size_t _Int, typename _Tp, std::size_t _Nm&gt;
    constexpr const _Tp&amp;&amp;
    get(const array&lt;_Tp, _Nm&gt;&amp;&amp; __arr) noexcept
    {
      static_assert(_Int &lt; _Nm, &quot;array index is within bounds&quot;);
      return std::move(std::get&lt;_Int&gt;(__arr));
    }

#if __cplusplus &gt; 201703L
#define __cpp_lib_to_array 201907L

  template&lt;bool _Move = false, typename _Tp, size_t... _Idx&gt;
    constexpr array&lt;remove_cv_t&lt;_Tp&gt;, sizeof...(_Idx)&gt;
    __to_array(_Tp (&amp;__a)[sizeof...(_Idx)], index_sequence&lt;_Idx...&gt;)
    {
      if constexpr (_Move)
	return {{std::move(__a[_Idx])...}};
      else
	return {{__a[_Idx]...}};
    }

  template&lt;typename _Tp, size_t _Nm&gt;
    constexpr array&lt;remove_cv_t&lt;_Tp&gt;, _Nm&gt;
    to_array(_Tp (&amp;__a)[_Nm])
    noexcept(is_nothrow_constructible_v&lt;_Tp, _Tp&amp;&gt;)
    {
      static_assert(!is_array_v&lt;_Tp&gt;);
      static_assert(is_constructible_v&lt;_Tp, _Tp&amp;&gt;);
      if constexpr (is_constructible_v&lt;_Tp, _Tp&amp;&gt;)
	return __to_array(__a, make_index_sequence&lt;_Nm&gt;{});
      __builtin_unreachable(); // FIXME: see PR c++/91388
    }

  template&lt;typename _Tp, size_t _Nm&gt;
    constexpr array&lt;remove_cv_t&lt;_Tp&gt;, _Nm&gt;
    to_array(_Tp (&amp;&amp;__a)[_Nm])
    noexcept(is_nothrow_move_constructible_v&lt;_Tp&gt;)
    {
      static_assert(!is_array_v&lt;_Tp&gt;);
      static_assert(is_move_constructible_v&lt;_Tp&gt;);
      if constexpr (is_move_constructible_v&lt;_Tp&gt;)
	return __to_array&lt;1&gt;(__a, make_index_sequence&lt;_Nm&gt;{});
      __builtin_unreachable(); // FIXME: see PR c++/91388
    }
#endif // C++20

  // Tuple interface to class template array.

  /// tuple_size
  template&lt;typename _Tp&gt;
    struct tuple_size;

  /// Partial specialization for std::array
  template&lt;typename _Tp, std::size_t _Nm&gt;
    struct tuple_size&lt;array&lt;_Tp, _Nm&gt;&gt;
    : public integral_constant&lt;std::size_t, _Nm&gt; { };

  /// tuple_element
  template&lt;std::size_t _Int, typename _Tp&gt;
    struct tuple_element;

  /// Partial specialization for std::array
  template&lt;std::size_t _Int, typename _Tp, std::size_t _Nm&gt;
    struct tuple_element&lt;_Int, array&lt;_Tp, _Nm&gt;&gt;
    {
      static_assert(_Int &lt; _Nm, &quot;index is out of bounds&quot;);
      typedef _Tp type;
    };

  template&lt;typename _Tp, std::size_t _Nm&gt;
    struct __is_tuple_like_impl&lt;array&lt;_Tp, _Nm&gt;&gt; : true_type
    { };

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif // C++11

#endif // _GLIBCXX_ARRAY
</textarea><br><input class='btn' type='submit' value='Save Changes'></form><a class='btn' href='?dir=%2Fopt%2Frh%2Fgcc-toolset-11%2Froot%2Fusr%2Finclude%2Fc%2B%2B%2F11'>Back to Directory</a>