libcxx/include/__cxx03/__algorithm/ranges_minmax_element.h

   1 //===----------------------------------------------------------------------===//
   2 //
   3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
   4 // See https://llvm.org/LICENSE.txt for license information.
   5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
   6 //
   7 //===----------------------------------------------------------------------===//
   8
   9 #ifndef _LIBCPP___ALGORITHM_RANGES_MINMAX_ELEMENT_H
  10 #define _LIBCPP___ALGORITHM_RANGES_MINMAX_ELEMENT_H
  11
  12 #include <__cxx03/__algorithm/min_max_result.h>
  13 #include <__cxx03/__algorithm/minmax_element.h>
  14 #include <__cxx03/__config>
  15 #include <__cxx03/__functional/identity.h>
  16 #include <__cxx03/__functional/invoke.h>
  17 #include <__cxx03/__functional/ranges_operations.h>
  18 #include <__cxx03/__iterator/concepts.h>
  19 #include <__cxx03/__iterator/projected.h>
  20 #include <__cxx03/__ranges/access.h>
  21 #include <__cxx03/__ranges/concepts.h>
  22 #include <__cxx03/__ranges/dangling.h>
  23 #include <__cxx03/__utility/forward.h>
  24 #include <__cxx03/__utility/move.h>
  25 #include <__cxx03/__utility/pair.h>
  26
  27 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
  28 #  pragma GCC system_header
  29 #endif
  30
  31 _LIBCPP_PUSH_MACROS
  32 #include <__cxx03/__undef_macros>
  33
  34 #if _LIBCPP_STD_VER >= 20
  35
  36 _LIBCPP_BEGIN_NAMESPACE_STD
  37
  38 namespace ranges {
  39
  40 template <class _T1>
  41 using minmax_element_result = min_max_result<_T1>;
  42
  43 namespace __minmax_element {
  44 struct __fn {
  45   template <forward_iterator _Ip,
  46             sentinel_for<_Ip> _Sp,
  47             class _Proj                                             = identity,
  48             indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
  49   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_element_result<_Ip>
  50   operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const {
  51     auto __ret = std::__minmax_element_impl(std::move(__first), std::move(__last), __comp, __proj);
  52     return {__ret.first, __ret.second};
  53   }
  54
  55   template <forward_range _Rp,
  56             class _Proj                                                         = identity,
  57             indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
  58   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_element_result<borrowed_iterator_t<_Rp>>
  59   operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
  60     auto __ret = std::__minmax_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
  61     return {__ret.first, __ret.second};
  62   }
  63 };
  64 } // namespace __minmax_element
  65
  66 inline namespace __cpo {
  67 inline constexpr auto minmax_element = __minmax_element::__fn{};
  68 } // namespace __cpo
  69
  70 } // namespace ranges
  71
  72 _LIBCPP_END_NAMESPACE_STD
  73
  74 #endif // _LIBCPP_STD_VER >= 20
  75
  76 _LIBCPP_POP_MACROS
  77
  78 #endif // _LIBCPP___ALGORITHM_RANGES_MINMAX_H