Yi Kong | 878f994 | 2023-12-13 12:55:04 +0900 | [diff] [blame^] | 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 <__algorithm/min_max_result.h> |
| 13 | #include <__algorithm/minmax_element.h> |
| 14 | #include <__config> |
| 15 | #include <__functional/identity.h> |
| 16 | #include <__functional/invoke.h> |
| 17 | #include <__functional/ranges_operations.h> |
| 18 | #include <__iterator/concepts.h> |
| 19 | #include <__iterator/projected.h> |
| 20 | #include <__ranges/access.h> |
| 21 | #include <__ranges/concepts.h> |
| 22 | #include <__ranges/dangling.h> |
| 23 | #include <__utility/forward.h> |
| 24 | #include <__utility/move.h> |
| 25 | #include <__utility/pair.h> |
| 26 | |
| 27 | #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) |
| 28 | # pragma GCC system_header |
| 29 | #endif |
| 30 | |
| 31 | #if _LIBCPP_STD_VER >= 20 |
| 32 | |
| 33 | _LIBCPP_BEGIN_NAMESPACE_STD |
| 34 | |
| 35 | namespace ranges { |
| 36 | |
| 37 | template <class _T1> |
| 38 | using minmax_element_result = min_max_result<_T1>; |
| 39 | |
| 40 | namespace __minmax_element { |
| 41 | struct __fn { |
| 42 | template <forward_iterator _Ip, |
| 43 | sentinel_for<_Ip> _Sp, |
| 44 | class _Proj = identity, |
| 45 | indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less> |
| 46 | _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_element_result<_Ip> |
| 47 | operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const { |
| 48 | auto __ret = std::__minmax_element_impl(std::move(__first), std::move(__last), __comp, __proj); |
| 49 | return {__ret.first, __ret.second}; |
| 50 | } |
| 51 | |
| 52 | template <forward_range _Rp, |
| 53 | class _Proj = identity, |
| 54 | indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less> |
| 55 | _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_element_result<borrowed_iterator_t<_Rp>> |
| 56 | operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { |
| 57 | auto __ret = std::__minmax_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj); |
| 58 | return {__ret.first, __ret.second}; |
| 59 | } |
| 60 | }; |
| 61 | } // namespace __minmax_element |
| 62 | |
| 63 | inline namespace __cpo { |
| 64 | inline constexpr auto minmax_element = __minmax_element::__fn{}; |
| 65 | } // namespace __cpo |
| 66 | |
| 67 | } // namespace ranges |
| 68 | |
| 69 | _LIBCPP_END_NAMESPACE_STD |
| 70 | |
| 71 | #endif // _LIBCPP_STD_VER >= 20 |
| 72 | |
| 73 | #endif // _LIBCPP___ALGORITHM_RANGES_MINMAX_H |