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_IS_HEAP_H
10 #define _LIBCPP___ALGORITHM_RANGES_IS_HEAP_H
11 
12 #include <__algorithm/is_heap_until.h>
13 #include <__algorithm/make_projected.h>
14 #include <__config>
15 #include <__functional/identity.h>
16 #include <__functional/ranges_operations.h>
17 #include <__iterator/concepts.h>
18 #include <__iterator/iterator_traits.h>
19 #include <__iterator/next.h>
20 #include <__iterator/projected.h>
21 #include <__ranges/access.h>
22 #include <__ranges/concepts.h>
23 #include <__utility/move.h>
24 
25 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
26 #  pragma GCC system_header
27 #endif
28 
29 _LIBCPP_PUSH_MACROS
30 #include <__undef_macros>
31 
32 #if _LIBCPP_STD_VER >= 20
33 
34 _LIBCPP_BEGIN_NAMESPACE_STD
35 
36 namespace ranges {
37 namespace __is_heap {
38 
39 struct __fn {
40   template <class _Iter, class _Sent, class _Proj, class _Comp>
41   _LIBCPP_HIDE_FROM_ABI constexpr static bool
42   __is_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
43     auto __last_iter        = ranges::next(__first, __last);
44     auto&& __projected_comp = std::__make_projected(__comp, __proj);
45 
46     auto __result = std::__is_heap_until(std::move(__first), std::move(__last_iter), __projected_comp);
47     return __result == __last;
48   }
49 
50   template <random_access_iterator _Iter,
51             sentinel_for<_Iter> _Sent,
52             class _Proj                                               = identity,
53             indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
54   _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr bool
55   operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
56     return __is_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
57   }
58 
59   template <random_access_range _Range,
60             class _Proj                                                            = identity,
61             indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
62   _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr bool
63   operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
64     return __is_heap_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
65   }
66 };
67 
68 } // namespace __is_heap
69 
70 inline namespace __cpo {
71 inline constexpr auto is_heap = __is_heap::__fn{};
72 } // namespace __cpo
73 } // namespace ranges
74 
75 _LIBCPP_END_NAMESPACE_STD
76 
77 #endif // _LIBCPP_STD_VER >= 20
78 
79 _LIBCPP_POP_MACROS
80 
81 #endif // _LIBCPP___ALGORITHM_RANGES_IS_HEAP_H
82