v1/__algorithm/ranges_is_heap_until.h

0001 //===----------------------------------------------------------------------===//
0002 //
0003 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
0004 // See https://llvm.org/LICENSE.txt for license information.
0005 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
0006 //
0007 //===----------------------------------------------------------------------===//
0008
0009 #ifndef _LIBCPP___ALGORITHM_RANGES_IS_HEAP_UNTIL_H
0010 #define _LIBCPP___ALGORITHM_RANGES_IS_HEAP_UNTIL_H
0011
0012 #include <__algorithm/is_heap_until.h>
0013 #include <__algorithm/make_projected.h>
0014 #include <__config>
0015 #include <__functional/identity.h>
0016 #include <__functional/ranges_operations.h>
0017 #include <__iterator/concepts.h>
0018 #include <__iterator/iterator_traits.h>
0019 #include <__iterator/next.h>
0020 #include <__iterator/projected.h>
0021 #include <__ranges/access.h>
0022 #include <__ranges/concepts.h>
0023 #include <__ranges/dangling.h>
0024 #include <__utility/move.h>
0025
0026 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
0027 #  pragma GCC system_header
0028 #endif
0029
0030 _LIBCPP_PUSH_MACROS
0031 #include <__undef_macros>
0032
0033 #if _LIBCPP_STD_VER >= 20
0034
0035 _LIBCPP_BEGIN_NAMESPACE_STD
0036
0037 namespace ranges {
0038 struct __is_heap_until {
0039   template <class _Iter, class _Sent, class _Proj, class _Comp>
0040   _LIBCPP_HIDE_FROM_ABI constexpr static _Iter
0041   __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
0042     auto __last_iter        = ranges::next(__first, __last);
0043     auto&& __projected_comp = std::__make_projected(__comp, __proj);
0044
0045     return std::__is_heap_until(std::move(__first), std::move(__last_iter), __projected_comp);
0046   }
0047
0048   template <random_access_iterator _Iter,
0049             sentinel_for<_Iter> _Sent,
0050             class _Proj                                               = identity,
0051             indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
0052   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter
0053   operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
0054     return __is_heap_until_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
0055   }
0056
0057   template <random_access_range _Range,
0058             class _Proj                                                            = identity,
0059             indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
0060   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
0061   operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
0062     return __is_heap_until_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
0063   }
0064 };
0065
0066 inline namespace __cpo {
0067 inline constexpr auto is_heap_until = __is_heap_until{};
0068 } // namespace __cpo
0069 } // namespace ranges
0070
0071 _LIBCPP_END_NAMESPACE_STD
0072
0073 #endif // _LIBCPP_STD_VER >= 20
0074
0075 _LIBCPP_POP_MACROS
0076
0077 #endif // _LIBCPP___ALGORITHM_RANGES_IS_HEAP_UNTIL_H