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_LIBCPP_PUSH_MACROS
31#include <__undef_macros>
32
33#if _LIBCPP_STD_VER >= 20
34
35_LIBCPP_BEGIN_NAMESPACE_STD
36
37namespace ranges {
38namespace __is_heap_until {
39
40struct __fn {
41  template <class _Iter, class _Sent, class _Proj, class _Comp>
42  _LIBCPP_HIDE_FROM_ABI constexpr static _Iter
43  __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
44    auto __last_iter        = ranges::next(__first, __last);
45    auto&& __projected_comp = std::__make_projected(__comp, __proj);
46
47    return std::__is_heap_until(std::move(__first), std::move(__last_iter), __projected_comp);
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 _Iter
55  operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
56    return __is_heap_until_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 borrowed_iterator_t<_Range>
63  operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
64    return __is_heap_until_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
65  }
66};
67
68} // namespace __is_heap_until
69
70inline namespace __cpo {
71inline constexpr auto is_heap_until = __is_heap_until::__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_UNTIL_H
82