[thirdparty/gcc.git] / libstdc++-v3 / include / std / utility

// <utility> -*- C++ -*-

// Copyright (C) 2001-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
// <http://www.gnu.org/licenses/>.

/*
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Hewlett-Packard Company makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 *
 * Copyright (c) 1996,1997
 * Silicon Graphics Computer Systems, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Silicon Graphics makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 */

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

#ifndef _GLIBCXX_UTILITY
#define _GLIBCXX_UTILITY 1

#pragma GCC system_header

/**
 * @defgroup utilities Utilities
 *
 * Components deemed generally useful. Includes pair, tuple,
 * forward/move helpers, ratio, function object, metaprogramming and
 * type traits, time, date, and memory functions.
 */

#include <bits/c++config.h>
#include <bits/stl_relops.h>
#include <bits/stl_pair.h>

#if __cplusplus >= 201103L

#include <type_traits>
#include <bits/move.h>
#include <initializer_list>

#if __cplusplus > 201703L
#include <ext/numeric_traits.h>
#endif

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

  /// Finds the size of a given tuple type.
  template<typename _Tp>
    struct tuple_size;

  // _GLIBCXX_RESOLVE_LIB_DEFECTS
  // 2313. tuple_size should always derive from integral_constant<size_t, N>
  // 2770. tuple_size<const T> specialization is not SFINAE compatible

  template<typename _Tp,
	   typename _Up = typename remove_cv<_Tp>::type,
	   typename = typename enable_if<is_same<_Tp, _Up>::value>::type,
	   size_t = tuple_size<_Tp>::value>
    using __enable_if_has_tuple_size = _Tp;

  template<typename _Tp>
    struct tuple_size<const __enable_if_has_tuple_size<_Tp>>
    : public tuple_size<_Tp> { };

  template<typename _Tp>
    struct tuple_size<volatile __enable_if_has_tuple_size<_Tp>>
    : public tuple_size<_Tp> { };

  template<typename _Tp>
    struct tuple_size<const volatile __enable_if_has_tuple_size<_Tp>>
    : public tuple_size<_Tp> { };

  /// Gives the type of the ith element of a given tuple type.
  template<size_t __i, typename _Tp>
    struct tuple_element;

  // Duplicate of C++14's tuple_element_t for internal use in C++11 mode
  template<size_t __i, typename _Tp>
    using __tuple_element_t = typename tuple_element<__i, _Tp>::type;

  template<size_t __i, typename _Tp>
    struct tuple_element<__i, const _Tp>
    {
      typedef typename add_const<__tuple_element_t<__i, _Tp>>::type type;
    };

  template<size_t __i, typename _Tp>
    struct tuple_element<__i, volatile _Tp>
    {
      typedef typename add_volatile<__tuple_element_t<__i, _Tp>>::type type;
    };

  template<size_t __i, typename _Tp>
    struct tuple_element<__i, const volatile _Tp>
    {
      typedef typename add_cv<__tuple_element_t<__i, _Tp>>::type type;
    };

#if __cplusplus >= 201402L
// The standard says this macro and alias template should be in <tuple>
// but we define them here, to be available when the partial specializations
// of tuple_element<pair<T,U>> and tuple_element<array<T,N>> are defined.
#define __cpp_lib_tuple_element_t 201402L

  template<size_t __i, typename _Tp>
    using tuple_element_t = typename tuple_element<__i, _Tp>::type;
#endif

  // Various functions which give std::pair a tuple-like interface.

  /// Partial specialization for std::pair
  template<typename _T1, typename _T2>
    struct __is_tuple_like_impl<pair<_T1, _T2>> : true_type
    { };

  /// Partial specialization for std::pair
  template<class _Tp1, class _Tp2>
    struct tuple_size<pair<_Tp1, _Tp2>>
    : public integral_constant<size_t, 2> { };

  /// Partial specialization for std::pair
  template<class _Tp1, class _Tp2>
    struct tuple_element<0, pair<_Tp1, _Tp2>>
    { typedef _Tp1 type; };

  /// Partial specialization for std::pair
  template<class _Tp1, class _Tp2>
    struct tuple_element<1, pair<_Tp1, _Tp2>>
    { typedef _Tp2 type; };

  template<size_t _Int>
    struct __pair_get;

  template<>
    struct __pair_get<0>
    {
      template<typename _Tp1, typename _Tp2>
	static constexpr _Tp1&
	__get(pair<_Tp1, _Tp2>& __pair) noexcept
	{ return __pair.first; }

      template<typename _Tp1, typename _Tp2>
	static constexpr _Tp1&&
	__move_get(pair<_Tp1, _Tp2>&& __pair) noexcept
	{ return std::forward<_Tp1>(__pair.first); }

      template<typename _Tp1, typename _Tp2>
	static constexpr const _Tp1&
	__const_get(const pair<_Tp1, _Tp2>& __pair) noexcept
	{ return __pair.first; }

      template<typename _Tp1, typename _Tp2>
	static constexpr const _Tp1&&
	__const_move_get(const pair<_Tp1, _Tp2>&& __pair) noexcept
	{ return std::forward<const _Tp1>(__pair.first); }
    };

  template<>
    struct __pair_get<1>
    {
      template<typename _Tp1, typename _Tp2>
	static constexpr _Tp2&
	__get(pair<_Tp1, _Tp2>& __pair) noexcept
	{ return __pair.second; }

      template<typename _Tp1, typename _Tp2>
	static constexpr _Tp2&&
	__move_get(pair<_Tp1, _Tp2>&& __pair) noexcept
	{ return std::forward<_Tp2>(__pair.second); }

      template<typename _Tp1, typename _Tp2>
	static constexpr const _Tp2&
	__const_get(const pair<_Tp1, _Tp2>& __pair) noexcept
	{ return __pair.second; }

      template<typename _Tp1, typename _Tp2>
	static constexpr const _Tp2&&
	__const_move_get(const pair<_Tp1, _Tp2>&& __pair) noexcept
	{ return std::forward<const _Tp2>(__pair.second); }
    };

  template<size_t _Int, class _Tp1, class _Tp2>
    constexpr typename tuple_element<_Int, pair<_Tp1, _Tp2>>::type&
    get(pair<_Tp1, _Tp2>& __in) noexcept
    { return __pair_get<_Int>::__get(__in); }

  template<size_t _Int, class _Tp1, class _Tp2>
    constexpr typename tuple_element<_Int, pair<_Tp1, _Tp2>>::type&&
    get(pair<_Tp1, _Tp2>&& __in) noexcept
    { return __pair_get<_Int>::__move_get(std::move(__in)); }

  template<size_t _Int, class _Tp1, class _Tp2>
    constexpr const typename tuple_element<_Int, pair<_Tp1, _Tp2>>::type&
    get(const pair<_Tp1, _Tp2>& __in) noexcept
    { return __pair_get<_Int>::__const_get(__in); }

  template<size_t _Int, class _Tp1, class _Tp2>
    constexpr const typename tuple_element<_Int, pair<_Tp1, _Tp2>>::type&&
    get(const pair<_Tp1, _Tp2>&& __in) noexcept
    { return __pair_get<_Int>::__const_move_get(std::move(__in)); }

#if __cplusplus >= 201402L

#define __cpp_lib_tuples_by_type 201304

  template <typename _Tp, typename _Up>
    constexpr _Tp&
    get(pair<_Tp, _Up>& __p) noexcept
    { return __p.first; }

  template <typename _Tp, typename _Up>
    constexpr const _Tp&
    get(const pair<_Tp, _Up>& __p) noexcept
    { return __p.first; }

  template <typename _Tp, typename _Up>
    constexpr _Tp&&
    get(pair<_Tp, _Up>&& __p) noexcept
    { return std::move(__p.first); }

  template <typename _Tp, typename _Up>
    constexpr const _Tp&&
    get(const pair<_Tp, _Up>&& __p) noexcept
    { return std::move(__p.first); }

  template <typename _Tp, typename _Up>
    constexpr _Tp&
    get(pair<_Up, _Tp>& __p) noexcept
    { return __p.second; }

  template <typename _Tp, typename _Up>
    constexpr const _Tp&
    get(const pair<_Up, _Tp>& __p) noexcept
    { return __p.second; }

  template <typename _Tp, typename _Up>
    constexpr _Tp&&
    get(pair<_Up, _Tp>&& __p) noexcept
    { return std::move(__p.second); }

  template <typename _Tp, typename _Up>
    constexpr const _Tp&&
    get(const pair<_Up, _Tp>&& __p) noexcept
    { return std::move(__p.second); }

#define __cpp_lib_exchange_function 201304

  /// Assign @p __new_val to @p __obj and return its previous value.
  template <typename _Tp, typename _Up = _Tp>
    _GLIBCXX20_CONSTEXPR
    inline _Tp
    exchange(_Tp& __obj, _Up&& __new_val)
    { return std::__exchange(__obj, std::forward<_Up>(__new_val)); }

#endif // C++14

  // Stores a tuple of indices.  Used by tuple and pair, and by bind() to
  // extract the elements in a tuple.
  template<size_t... _Indexes> struct _Index_tuple { };

  // Builds an _Index_tuple<0, 1, 2, ..., _Num-1>.
  template<size_t _Num>
    struct _Build_index_tuple
    {
#if __has_builtin(__make_integer_seq)
      template<typename, size_t... _Indices>
        using _IdxTuple = _Index_tuple<_Indices...>;

      // Clang defines __make_integer_seq for this purpose.
      using __type = __make_integer_seq<_IdxTuple, size_t, _Num>;
#else
      // For GCC and other compilers, use __integer_pack instead.
      using __type = _Index_tuple<__integer_pack(_Num)...>;
#endif
    };

#if __cplusplus >= 201402L

#define __cpp_lib_integer_sequence 201304

  /// Class template integer_sequence
  template<typename _Tp, _Tp... _Idx>
    struct integer_sequence
    {
      typedef _Tp value_type;
      static constexpr size_t size() noexcept { return sizeof...(_Idx); }
    };

  /// Alias template make_integer_sequence
  template<typename _Tp, _Tp _Num>
    using make_integer_sequence
#if __has_builtin(__make_integer_seq)
      = __make_integer_seq<integer_sequence, _Tp, _Num>;
#else
      = integer_sequence<_Tp, __integer_pack(_Num)...>;
#endif

  /// Alias template index_sequence
  template<size_t... _Idx>
    using index_sequence = integer_sequence<size_t, _Idx...>;

  /// Alias template make_index_sequence
  template<size_t _Num>
    using make_index_sequence = make_integer_sequence<size_t, _Num>;

  /// Alias template index_sequence_for
  template<typename... _Types>
    using index_sequence_for = make_index_sequence<sizeof...(_Types)>;
#endif

#if __cplusplus > 201402L

  struct in_place_t {
    explicit in_place_t() = default;
  };

  inline constexpr in_place_t in_place{};

  template<typename _Tp> struct in_place_type_t
  {
    explicit in_place_type_t() = default;
  };

  template<typename _Tp>
    inline constexpr in_place_type_t<_Tp> in_place_type{};

  template<size_t _Idx> struct in_place_index_t
  {
    explicit in_place_index_t() = default;
  };

  template<size_t _Idx>
    inline constexpr in_place_index_t<_Idx> in_place_index{};

  template<typename>
    struct __is_in_place_type_impl : false_type
    { };

  template<typename _Tp>
    struct __is_in_place_type_impl<in_place_type_t<_Tp>> : true_type
    { };

  template<typename _Tp>
    struct __is_in_place_type
      : public __is_in_place_type_impl<_Tp>
    { };

#define  __cpp_lib_as_const 201510
  template<typename _Tp>
    [[nodiscard]]
    constexpr add_const_t<_Tp>&
    as_const(_Tp& __t) noexcept
    { return __t; }

  template<typename _Tp>
    void as_const(const _Tp&&) = delete;

#if __cplusplus > 201703L
#define __cpp_lib_integer_comparison_functions 202002L

  template<typename _Tp, typename _Up>
    constexpr bool
    cmp_equal(_Tp __t, _Up __u) noexcept
    {
      static_assert(__is_standard_integer<_Tp>::value);
      static_assert(__is_standard_integer<_Up>::value);

      if constexpr (is_signed_v<_Tp> == is_signed_v<_Up>)
	return __t == __u;
      else if constexpr (is_signed_v<_Tp>)
	return __t >= 0 && make_unsigned_t<_Tp>(__t) == __u;
      else
	return __u >= 0 && __t == make_unsigned_t<_Up>(__u);
    }

  template<typename _Tp, typename _Up>
    constexpr bool
    cmp_not_equal(_Tp __t, _Up __u) noexcept
    { return !std::cmp_equal(__t, __u); }

  template<typename _Tp, typename _Up>
    constexpr bool
    cmp_less(_Tp __t, _Up __u) noexcept
    {
      static_assert(__is_standard_integer<_Tp>::value);
      static_assert(__is_standard_integer<_Up>::value);

      if constexpr (is_signed_v<_Tp> == is_signed_v<_Up>)
	return __t < __u;
      else if constexpr (is_signed_v<_Tp>)
	return __t < 0 || make_unsigned_t<_Tp>(__t) < __u;
      else
	return __u >= 0 && __t < make_unsigned_t<_Up>(__u);
    }

  template<typename _Tp, typename _Up>
    constexpr bool
    cmp_greater(_Tp __t, _Up __u) noexcept
    { return std::cmp_less(__u, __t); }

  template<typename _Tp, typename _Up>
    constexpr bool
    cmp_less_equal(_Tp __t, _Up __u) noexcept
    { return !std::cmp_less(__u, __t); }

  template<typename _Tp, typename _Up>
    constexpr bool
    cmp_greater_equal(_Tp __t, _Up __u) noexcept
    { return !std::cmp_less(__t, __u); }

  template<typename _Up, typename _Tp>
    constexpr bool
    in_range(_Tp __t) noexcept
    {
      static_assert(__is_standard_integer<_Up>::value);
      static_assert(__is_standard_integer<_Tp>::value);
      using __gnu_cxx::__int_traits;

      if constexpr (is_signed_v<_Tp> == is_signed_v<_Up>)
	return __int_traits<_Up>::__min <= __t
	  && __t <= __int_traits<_Up>::__max;
      else if constexpr (is_signed_v<_Tp>)
	return __t >= 0
	  && make_unsigned_t<_Tp>(__t) <= __int_traits<_Up>::__max;
      else
	return __t <= make_unsigned_t<_Up>(__int_traits<_Up>::__max);
    }

#if __cplusplus > 202002L
#define __cpp_lib_to_underlying 202102L
  /// Convert an object of enumeration type to its underlying type.
  template<typename _Tp>
    [[nodiscard]]
    constexpr underlying_type_t<_Tp>
    to_underlying(_Tp __value) noexcept
    { return static_cast<underlying_type_t<_Tp>>(__value); }
#endif // C++23
#endif // C++20
#endif // C++17

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

#endif

#endif /* _GLIBCXX_UTILITY */
Commit	Line	Data
54c1bf78	1	// <utility> -- C++ --
de96ac46	2
99dee823	3	// Copyright (C) 2001-2021 Free Software Foundation, Inc.
de96ac46 BK	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
748086b7	8	// Free Software Foundation; either version 3, or (at your option)
de96ac46 BK	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
748086b7 JJ	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.
de96ac46	19
748086b7 JJ	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/>.
de96ac46	24
54c1bf78 BK	25	/*
	26	*
	27	* Copyright (c) 1994
	28	* Hewlett-Packard Company
	29	*
	30	* Permission to use, copy, modify, distribute and sell this software
	31	* and its documentation for any purpose is hereby granted without fee,
	32	* provided that the above copyright notice appear in all copies and
	33	* that both that copyright notice and this permission notice appear
	34	* in supporting documentation. Hewlett-Packard Company makes no
	35	* representations about the suitability of this software for any
	36	* purpose. It is provided "as is" without express or implied warranty.
	37	*
	38	*
	39	* Copyright (c) 1996,1997
	40	* Silicon Graphics Computer Systems, Inc.
	41	*
	42	* Permission to use, copy, modify, distribute and sell this software
	43	* and its documentation for any purpose is hereby granted without fee,
	44	* provided that the above copyright notice appear in all copies and
	45	* that both that copyright notice and this permission notice appear
	46	* in supporting documentation. Silicon Graphics makes no
	47	* representations about the suitability of this software for any
	48	* purpose. It is provided "as is" without express or implied warranty.
	49	*/
	50
143c27b0	51	/** @file include/utility
33ac58d5	52	* This is a Standard C++ Library header.
2f9d51b8 PE	53	*/
2f9d51b8 PE	54
1143680e SE	55	#ifndef _GLIBCXX_UTILITY
1143680e SE	56	#define _GLIBCXX_UTILITY 1
54c1bf78 BK	57
54c1bf78 BK	58	#pragma GCC system_header
285b36d6	59
8e32aa11 BK	60	/**
	61	* @defgroup utilities Utilities
	62	*
	63	* Components deemed generally useful. Includes pair, tuple,
	64	* forward/move helpers, ratio, function object, metaprogramming and
	65	* type traits, time, date, and memory functions.
	66	*/
	67
54c1bf78 BK	68	#include <bits/c++config.h>
	69	#include <bits/stl_relops.h>
	70	#include <bits/stl_pair.h>
	71
734f5023	72	#if __cplusplus >= 201103L
a15f7cb8	73
7d17de7f	74	#include <type_traits>
53dc5044 PC	75	#include <bits/move.h>
	76	#include <initializer_list>
	77
98cf2c26	78	#if __cplusplus > 201703L
eb04805b	79	#include <ext/numeric_traits.h>
98cf2c26 JW	80	#endif
98cf2c26 JW	81
12ffa228 BK	82	namespace std _GLIBCXX_VISIBILITY(default)
	83	{
	84	_GLIBCXX_BEGIN_NAMESPACE_VERSION
53dc5044	85
de0830e1 VV	86	/// Finds the size of a given tuple type.
	87	template<typename _Tp>
	88	struct tuple_size;
	89
	90	// _GLIBCXX_RESOLVE_LIB_DEFECTS
f859f912	91	// 2313. tuple_size should always derive from integral_constant<size_t, N>
6ae2ae3b	92	// 2770. tuple_size<const T> specialization is not SFINAE compatible
6ae2ae3b	93
f859f912 JW	94	template<typename _Tp,
	95	typename _Up = typename remove_cv<_Tp>::type,
	96	typename = typename enable_if<is_same<_Tp, _Up>::value>::type,
	97	size_t = tuple_size<_Tp>::value>
	98	using __enable_if_has_tuple_size = _Tp;
de0830e1	99
6ae2ae3b	100	template<typename _Tp>
f859f912 JW	101	struct tuple_size<const __enable_if_has_tuple_size<_Tp>>
f859f912 JW	102	: public tuple_size<_Tp> { };
6ae2ae3b	103
de0830e1	104	template<typename _Tp>
f859f912 JW	105	struct tuple_size<volatile __enable_if_has_tuple_size<_Tp>>
f859f912 JW	106	: public tuple_size<_Tp> { };
de0830e1 VV	107
de0830e1 VV	108	template<typename _Tp>
f859f912 JW	109	struct tuple_size<const volatile __enable_if_has_tuple_size<_Tp>>
f859f912 JW	110	: public tuple_size<_Tp> { };
de0830e1 VV	111
de0830e1 VV	112	/// Gives the type of the ith element of a given tuple type.
a7a3932e	113	template<size_t __i, typename _Tp>
de0830e1 VV	114	struct tuple_element;
	115
	116	// Duplicate of C++14's tuple_element_t for internal use in C++11 mode
a7a3932e	117	template<size_t __i, typename _Tp>
de0830e1 VV	118	using __tuple_element_t = typename tuple_element<__i, _Tp>::type;
de0830e1 VV	119
a7a3932e	120	template<size_t __i, typename _Tp>
de0830e1 VV	121	struct tuple_element<__i, const _Tp>
	122	{
	123	typedef typename add_const<__tuple_element_t<__i, _Tp>>::type type;
	124	};
	125
a7a3932e	126	template<size_t __i, typename _Tp>
de0830e1 VV	127	struct tuple_element<__i, volatile _Tp>
	128	{
	129	typedef typename add_volatile<__tuple_element_t<__i, _Tp>>::type type;
	130	};
	131
a7a3932e	132	template<size_t __i, typename _Tp>
de0830e1 VV	133	struct tuple_element<__i, const volatile _Tp>
	134	{
	135	typedef typename add_cv<__tuple_element_t<__i, _Tp>>::type type;
	136	};
	137
2d26d4ce JW	138	#if __cplusplus >= 201402L
	139	// The standard says this macro and alias template should be in <tuple>
	140	// but we define them here, to be available when the partial specializations
	141	// of tuple_element<pair<T,U>> and tuple_element<array<T,N>> are defined.
	142	#define __cpp_lib_tuple_element_t 201402L
	143
a7a3932e	144	template<size_t __i, typename _Tp>
2d26d4ce JW	145	using tuple_element_t = typename tuple_element<__i, _Tp>::type;
	146	#endif
	147
7d17de7f FD	148	// Various functions which give std::pair a tuple-like interface.
	149
	150	/// Partial specialization for std::pair
	151	template<typename _T1, typename _T2>
a7a3932e	152	struct __is_tuple_like_impl<pair<_T1, _T2>> : true_type
7d17de7f	153	{ };
3a004764 JW	154
3a004764 JW	155	/// Partial specialization for std::pair
53dc5044	156	template<class _Tp1, class _Tp2>
a7a3932e JW	157	struct tuple_size<pair<_Tp1, _Tp2>>
a7a3932e JW	158	: public integral_constant<size_t, 2> { };
53dc5044	159
3a004764	160	/// Partial specialization for std::pair
53dc5044	161	template<class _Tp1, class _Tp2>
a7a3932e	162	struct tuple_element<0, pair<_Tp1, _Tp2>>
53dc5044	163	{ typedef _Tp1 type; };
33ac58d5	164
3a004764	165	/// Partial specialization for std::pair
53dc5044	166	template<class _Tp1, class _Tp2>
a7a3932e	167	struct tuple_element<1, pair<_Tp1, _Tp2>>
53dc5044 PC	168	{ typedef _Tp2 type; };
53dc5044 PC	169
a7a3932e	170	template<size_t _Int>
53dc5044 PC	171	struct __pair_get;
	172
	173	template<>
	174	struct __pair_get<0>
	175	{
	176	template<typename _Tp1, typename _Tp2>
a7a3932e JW	177	static constexpr _Tp1&
	178	__get(pair<_Tp1, _Tp2>& __pair) noexcept
	179	{ return __pair.first; }
18eeaec4	180
18eeaec4	181	template<typename _Tp1, typename _Tp2>
a7a3932e JW	182	static constexpr _Tp1&&
	183	__move_get(pair<_Tp1, _Tp2>&& __pair) noexcept
	184	{ return std::forward<_Tp1>(__pair.first); }
53dc5044 PC	185
53dc5044 PC	186	template<typename _Tp1, typename _Tp2>
a7a3932e JW	187	static constexpr const _Tp1&
	188	__const_get(const pair<_Tp1, _Tp2>& __pair) noexcept
	189	{ return __pair.first; }
ccbbf8df VV	190
ccbbf8df VV	191	template<typename _Tp1, typename _Tp2>
a7a3932e JW	192	static constexpr const _Tp1&&
	193	__const_move_get(const pair<_Tp1, _Tp2>&& __pair) noexcept
	194	{ return std::forward<const _Tp1>(__pair.first); }
53dc5044 PC	195	};
	196
	197	template<>
	198	struct __pair_get<1>
	199	{
	200	template<typename _Tp1, typename _Tp2>
a7a3932e JW	201	static constexpr _Tp2&
	202	__get(pair<_Tp1, _Tp2>& __pair) noexcept
	203	{ return __pair.second; }
18eeaec4	204
18eeaec4	205	template<typename _Tp1, typename _Tp2>
a7a3932e JW	206	static constexpr _Tp2&&
	207	__move_get(pair<_Tp1, _Tp2>&& __pair) noexcept
	208	{ return std::forward<_Tp2>(__pair.second); }
53dc5044 PC	209
53dc5044 PC	210	template<typename _Tp1, typename _Tp2>
a7a3932e JW	211	static constexpr const _Tp2&
	212	__const_get(const pair<_Tp1, _Tp2>& __pair) noexcept
	213	{ return __pair.second; }
ccbbf8df VV	214
ccbbf8df VV	215	template<typename _Tp1, typename _Tp2>
a7a3932e JW	216	static constexpr const _Tp2&&
	217	__const_move_get(const pair<_Tp1, _Tp2>&& __pair) noexcept
	218	{ return std::forward<const _Tp2>(__pair.second); }
53dc5044 PC	219	};
53dc5044 PC	220
a7a3932e JW	221	template<size_t _Int, class _Tp1, class _Tp2>
	222	constexpr typename tuple_element<_Int, pair<_Tp1, _Tp2>>::type&
	223	get(pair<_Tp1, _Tp2>& __in) noexcept
53dc5044 PC	224	{ return __pair_get<_Int>::__get(__in); }
53dc5044 PC	225
a7a3932e JW	226	template<size_t _Int, class _Tp1, class _Tp2>
	227	constexpr typename tuple_element<_Int, pair<_Tp1, _Tp2>>::type&&
	228	get(pair<_Tp1, _Tp2>&& __in) noexcept
18eeaec4	229	{ return __pair_get<_Int>::__move_get(std::move(__in)); }
18eeaec4	230
a7a3932e JW	231	template<size_t _Int, class _Tp1, class _Tp2>
	232	constexpr const typename tuple_element<_Int, pair<_Tp1, _Tp2>>::type&
	233	get(const pair<_Tp1, _Tp2>& __in) noexcept
53dc5044 PC	234	{ return __pair_get<_Int>::__const_get(__in); }
53dc5044 PC	235
a7a3932e JW	236	template<size_t _Int, class _Tp1, class _Tp2>
	237	constexpr const typename tuple_element<_Int, pair<_Tp1, _Tp2>>::type&&
	238	get(const pair<_Tp1, _Tp2>&& __in) noexcept
ccbbf8df VV	239	{ return __pair_get<_Int>::__const_move_get(std::move(__in)); }
ccbbf8df VV	240
2025db69	241	#if __cplusplus >= 201402L
a15f7cb8 ESR	242
	243	#define __cpp_lib_tuples_by_type 201304
	244
b5a8fed6 JW	245	template <typename _Tp, typename _Up>
	246	constexpr _Tp&
	247	get(pair<_Tp, _Up>& __p) noexcept
	248	{ return __p.first; }
	249
	250	template <typename _Tp, typename _Up>
	251	constexpr const _Tp&
	252	get(const pair<_Tp, _Up>& __p) noexcept
	253	{ return __p.first; }
	254
	255	template <typename _Tp, typename _Up>
	256	constexpr _Tp&&
	257	get(pair<_Tp, _Up>&& __p) noexcept
	258	{ return std::move(__p.first); }
	259
ccbbf8df VV	260	template <typename _Tp, typename _Up>
	261	constexpr const _Tp&&
	262	get(const pair<_Tp, _Up>&& __p) noexcept
	263	{ return std::move(__p.first); }
	264
b5a8fed6 JW	265	template <typename _Tp, typename _Up>
	266	constexpr _Tp&
	267	get(pair<_Up, _Tp>& __p) noexcept
	268	{ return __p.second; }
	269
	270	template <typename _Tp, typename _Up>
	271	constexpr const _Tp&
	272	get(const pair<_Up, _Tp>& __p) noexcept
	273	{ return __p.second; }
	274
	275	template <typename _Tp, typename _Up>
	276	constexpr _Tp&&
	277	get(pair<_Up, _Tp>&& __p) noexcept
	278	{ return std::move(__p.second); }
	279
ccbbf8df VV	280	template <typename _Tp, typename _Up>
	281	constexpr const _Tp&&
	282	get(const pair<_Up, _Tp>&& __p) noexcept
	283	{ return std::move(__p.second); }
	284
a15f7cb8 ESR	285	#define __cpp_lib_exchange_function 201304
a15f7cb8 ESR	286
c98b0598	287	/// Assign @p __new_val to @p __obj and return its previous value.
b5a8fed6	288	template <typename _Tp, typename _Up = _Tp>
3a66e68a	289	_GLIBCXX20_CONSTEXPR
c98b0598 JW	290	inline _Tp
c98b0598 JW	291	exchange(_Tp& __obj, _Up&& __new_val)
9b817548	292	{ return std::__exchange(__obj, std::forward<_Up>(__new_val)); }
3a66e68a	293
2025db69	294	#endif // C++14
c98b0598	295
1b1bdc03 JW	296	// Stores a tuple of indices. Used by tuple and pair, and by bind() to
1b1bdc03 JW	297	// extract the elements in a tuple.
5f0b7c95 JW	298	template<size_t... _Indexes> struct _Index_tuple { };
5f0b7c95 JW	299
1b1bdc03 JW	300	// Builds an _Index_tuple<0, 1, 2, ..., _Num-1>.
	301	template<size_t _Num>
	302	struct _Build_index_tuple
	303	{
4d4f8295	304	#if __has_builtin(__make_integer_seq)
db624b3b JW	305	template<typename, size_t... _Indices>
db624b3b JW	306	using _IdxTuple = _Index_tuple<_Indices...>;
1b1bdc03	307
4d4f8295	308	// Clang defines __make_integer_seq for this purpose.
db624b3b JW	309	using __type = __make_integer_seq<_IdxTuple, size_t, _Num>;
db624b3b JW	310	#else
4d4f8295	311	// For GCC and other compilers, use __integer_pack instead.
db624b3b JW	312	using __type = _Index_tuple<__integer_pack(_Num)...>;
db624b3b JW	313	#endif
1b1bdc03 JW	314	};
1b1bdc03 JW	315
4d4f8295	316	#if __cplusplus >= 201402L
a15f7cb8 ESR	317
	318	#define __cpp_lib_integer_sequence 201304
	319
1b1bdc03 JW	320	/// Class template integer_sequence
	321	template<typename _Tp, _Tp... _Idx>
	322	struct integer_sequence
	323	{
	324	typedef _Tp value_type;
352111c5	325	static constexpr size_t size() noexcept { return sizeof...(_Idx); }
1b1bdc03 JW	326	};
1b1bdc03 JW	327
1b1bdc03 JW	328	/// Alias template make_integer_sequence
	329	template<typename _Tp, _Tp _Num>
	330	using make_integer_sequence
4d4f8295	331	#if __has_builtin(__make_integer_seq)
db624b3b JW	332	= __make_integer_seq<integer_sequence, _Tp, _Num>;
	333	#else
	334	= integer_sequence<_Tp, __integer_pack(_Num)...>;
	335	#endif
	336
1b1bdc03 JW	337	/// Alias template index_sequence
	338	template<size_t... _Idx>
	339	using index_sequence = integer_sequence<size_t, _Idx...>;
	340
	341	/// Alias template make_index_sequence
	342	template<size_t _Num>
	343	using make_index_sequence = make_integer_sequence<size_t, _Num>;
	344
	345	/// Alias template index_sequence_for
	346	template<typename... _Types>
	347	using index_sequence_for = make_index_sequence<sizeof...(_Types)>;
	348	#endif
	349
25a69162 VV	350	#if __cplusplus > 201402L
25a69162 VV	351
627a2f59 VV	352	struct in_place_t {
627a2f59 VV	353	explicit in_place_t() = default;
25a69162 VV	354	};
25a69162 VV	355
627a2f59 VV	356	inline constexpr in_place_t in_place{};
	357
	358	template<typename _Tp> struct in_place_type_t
	359	{
	360	explicit in_place_type_t() = default;
	361	};
	362
	363	template<typename _Tp>
	364	inline constexpr in_place_type_t<_Tp> in_place_type{};
	365
	366	template<size_t _Idx> struct in_place_index_t
	367	{
	368	explicit in_place_index_t() = default;
	369	};
	370
	371	template<size_t _Idx>
	372	inline constexpr in_place_index_t<_Idx> in_place_index{};
25a69162	373
5c578ae4 VV	374	template<typename>
	375	struct __is_in_place_type_impl : false_type
	376	{ };
	377
	378	template<typename _Tp>
	379	struct __is_in_place_type_impl<in_place_type_t<_Tp>> : true_type
	380	{ };
	381
	382	template<typename _Tp>
	383	struct __is_in_place_type
	384	: public __is_in_place_type_impl<_Tp>
	385	{ };
	386
32eaac9c JW	387	#define __cpp_lib_as_const 201510
32eaac9c JW	388	template<typename _Tp>
406f58e1 JW	389	[[nodiscard]]
	390	constexpr add_const_t<_Tp>&
	391	as_const(_Tp& __t) noexcept
	392	{ return __t; }
32eaac9c JW	393
	394	template<typename _Tp>
	395	void as_const(const _Tp&&) = delete;
	396
98cf2c26 JW	397	#if __cplusplus > 201703L
	398	#define __cpp_lib_integer_comparison_functions 202002L
	399
	400	template<typename _Tp, typename _Up>
	401	constexpr bool
	402	cmp_equal(_Tp __t, _Up __u) noexcept
	403	{
	404	static_assert(__is_standard_integer<_Tp>::value);
	405	static_assert(__is_standard_integer<_Up>::value);
	406
	407	if constexpr (is_signed_v<_Tp> == is_signed_v<_Up>)
	408	return __t == __u;
	409	else if constexpr (is_signed_v<_Tp>)
	410	return __t >= 0 && make_unsigned_t<_Tp>(__t) == __u;
	411	else
	412	return __u >= 0 && __t == make_unsigned_t<_Up>(__u);
	413	}
	414
	415	template<typename _Tp, typename _Up>
	416	constexpr bool
	417	cmp_not_equal(_Tp __t, _Up __u) noexcept
	418	{ return !std::cmp_equal(__t, __u); }
	419
	420	template<typename _Tp, typename _Up>
	421	constexpr bool
	422	cmp_less(_Tp __t, _Up __u) noexcept
	423	{
	424	static_assert(__is_standard_integer<_Tp>::value);
	425	static_assert(__is_standard_integer<_Up>::value);
	426
	427	if constexpr (is_signed_v<_Tp> == is_signed_v<_Up>)
	428	return __t < __u;
	429	else if constexpr (is_signed_v<_Tp>)
	430	return __t < 0 \|\| make_unsigned_t<_Tp>(__t) < __u;
	431	else
	432	return __u >= 0 && __t < make_unsigned_t<_Up>(__u);
	433	}
	434
	435	template<typename _Tp, typename _Up>
	436	constexpr bool
	437	cmp_greater(_Tp __t, _Up __u) noexcept
	438	{ return std::cmp_less(__u, __t); }
	439
	440	template<typename _Tp, typename _Up>
	441	constexpr bool
	442	cmp_less_equal(_Tp __t, _Up __u) noexcept
	443	{ return !std::cmp_less(__u, __t); }
	444
	445	template<typename _Tp, typename _Up>
	446	constexpr bool
	447	cmp_greater_equal(_Tp __t, _Up __u) noexcept
	448	{ return !std::cmp_less(__t, __u); }
	449
	450	template<typename _Up, typename _Tp>
	451	constexpr bool
	452	in_range(_Tp __t) noexcept
	453	{
	454	static_assert(__is_standard_integer<_Up>::value);
	455	static_assert(__is_standard_integer<_Tp>::value);
eb04805b	456	using __gnu_cxx::__int_traits;
98cf2c26 JW	457
98cf2c26 JW	458	if constexpr (is_signed_v<_Tp> == is_signed_v<_Up>)
eb04805b JW	459	return __int_traits<_Up>::__min <= __t
eb04805b JW	460	&& __t <= __int_traits<_Up>::__max;
98cf2c26 JW	461	else if constexpr (is_signed_v<_Tp>)
98cf2c26 JW	462	return __t >= 0
eb04805b	463	&& make_unsigned_t<_Tp>(__t) <= __int_traits<_Up>::__max;
98cf2c26	464	else
eb04805b	465	return __t <= make_unsigned_t<_Up>(__int_traits<_Up>::__max);
98cf2c26	466	}
7244879b JW	467
	468	#if __cplusplus > 202002L
	469	#define __cpp_lib_to_underlying 202102L
	470	/// Convert an object of enumeration type to its underlying type.
	471	template<typename _Tp>
406f58e1	472	[[nodiscard]]
7244879b JW	473	constexpr underlying_type_t<_Tp>
	474	to_underlying(_Tp __value) noexcept
	475	{ return static_cast<underlying_type_t<_Tp>>(__value); }
	476	#endif // C++23
98cf2c26	477	#endif // C++20
5c578ae4	478	#endif // C++17
25a69162	479
12ffa228 BK	480	_GLIBCXX_END_NAMESPACE_VERSION
12ffa228 BK	481	} // namespace
53dc5044	482
af13a7a6 BK	483	#endif
af13a7a6 BK	484
1143680e	485	#endif /* _GLIBCXX_UTILITY */