78 lines · c
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-exception6//7//===----------------------------------------------------------------------===//8 9#ifndef _LIBCPP___ALGORITHM_RANGES_IS_HEAP_H10#define _LIBCPP___ALGORITHM_RANGES_IS_HEAP_H11 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_header27#endif28 29_LIBCPP_PUSH_MACROS30#include <__undef_macros>31 32#if _LIBCPP_STD_VER >= 2033 34_LIBCPP_BEGIN_NAMESPACE_STD35 36namespace ranges {37struct __is_heap {38 template <class _Iter, class _Sent, class _Proj, class _Comp>39 _LIBCPP_HIDE_FROM_ABI constexpr static bool40 __is_heap_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 auto __result = std::__is_heap_until(std::move(__first), std::move(__last_iter), __projected_comp);45 return __result == __last;46 }47 48 template <random_access_iterator _Iter,49 sentinel_for<_Iter> _Sent,50 class _Proj = identity,51 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>52 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool53 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {54 return __is_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);55 }56 57 template <random_access_range _Range,58 class _Proj = identity,59 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>60 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool61 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {62 return __is_heap_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);63 }64};65 66inline namespace __cpo {67inline constexpr auto is_heap = __is_heap{};68} // namespace __cpo69} // namespace ranges70 71_LIBCPP_END_NAMESPACE_STD72 73#endif // _LIBCPP_STD_VER >= 2074 75_LIBCPP_POP_MACROS76 77#endif // _LIBCPP___ALGORITHM_RANGES_IS_HEAP_H78