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