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_UNTIL_H
10 #define _LIBCPP___ALGORITHM_RANGES_IS_HEAP_UNTIL_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 <__ranges/dangling.h>
24 #include <__utility/move.h>
25 
26 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
27 #  pragma GCC system_header
28 #endif
29 
30 #if _LIBCPP_STD_VER >= 20
31 
32 _LIBCPP_BEGIN_NAMESPACE_STD
33 
34 namespace ranges {
35 namespace __is_heap_until {
36 
37 struct __fn {
38   template <class _Iter, class _Sent, class _Proj, class _Comp>
39   _LIBCPP_HIDE_FROM_ABI constexpr static _Iter
40   __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
41     auto __last_iter        = ranges::next(__first, __last);
42     auto&& __projected_comp = std::__make_projected(__comp, __proj);
43 
44     return std::__is_heap_until(std::move(__first), std::move(__last_iter), __projected_comp);
45   }
46 
47   template <random_access_iterator _Iter,
48             sentinel_for<_Iter> _Sent,
49             class _Proj                                               = identity,
50             indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
51   _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr _Iter
52   operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
53     return __is_heap_until_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
54   }
55 
56   template <random_access_range _Range,
57             class _Proj                                                            = identity,
58             indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
59   _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
60   operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
61     return __is_heap_until_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
62   }
63 };
64 
65 } // namespace __is_heap_until
66 
67 inline namespace __cpo {
68 inline constexpr auto is_heap_until = __is_heap_until::__fn{};
69 } // namespace __cpo
70 } // namespace ranges
71 
72 _LIBCPP_END_NAMESPACE_STD
73 
74 #endif // _LIBCPP_STD_VER >= 20
75 
76 #endif // _LIBCPP___ALGORITHM_RANGES_IS_HEAP_UNTIL_H
77