Warning: This file is not a C or C++ file. It does not have highlighting.
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 | _LIBCPP_PUSH_MACROS |
32 | #include <__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 | struct __minmax_element { |
44 | template <forward_iterator _Ip, |
45 | sentinel_for<_Ip> _Sp, |
46 | class _Proj = identity, |
47 | indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less> |
48 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_element_result<_Ip> |
49 | operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const { |
50 | auto __ret = std::__minmax_element_impl(std::move(__first), std::move(__last), __comp, __proj); |
51 | return {__ret.first, __ret.second}; |
52 | } |
53 | |
54 | template <forward_range _Rp, |
55 | class _Proj = identity, |
56 | indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less> |
57 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_element_result<borrowed_iterator_t<_Rp>> |
58 | operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { |
59 | auto __ret = std::__minmax_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj); |
60 | return {__ret.first, __ret.second}; |
61 | } |
62 | }; |
63 | |
64 | inline namespace __cpo { |
65 | inline constexpr auto minmax_element = __minmax_element{}; |
66 | } // namespace __cpo |
67 | |
68 | } // namespace ranges |
69 | |
70 | _LIBCPP_END_NAMESPACE_STD |
71 | |
72 | #endif // _LIBCPP_STD_VER >= 20 |
73 | |
74 | _LIBCPP_POP_MACROS |
75 | |
76 | #endif // _LIBCPP___ALGORITHM_RANGES_MINMAX_H |
77 |
Warning: This file is not a C or C++ file. It does not have highlighting.