v1/__algorithm/is_heap.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_IS_HEAP_H
0010 #define _LIBCPP___ALGORITHM_IS_HEAP_H
0011
0012 #include <__algorithm/comp.h>
0013 #include <__algorithm/comp_ref_type.h>
0014 #include <__algorithm/is_heap_until.h>
0015 #include <__config>
0016
0017 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
0018 #  pragma GCC system_header
0019 #endif
0020
0021 _LIBCPP_BEGIN_NAMESPACE_STD
0022
0023 template <class _RandomAccessIterator, class _Compare>
0024 [[__nodiscard__]] inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
0025 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
0026   return std::__is_heap_until(__first, __last, static_cast<__comp_ref_type<_Compare> >(__comp)) == __last;
0027 }
0028
0029 template <class _RandomAccessIterator>
0030 [[__nodiscard__]] inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
0031 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) {
0032   return std::is_heap(__first, __last, __less<>());
0033 }
0034
0035 _LIBCPP_END_NAMESPACE_STD
0036
0037 #endif // _LIBCPP___ALGORITHM_IS_HEAP_H