mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-04-05 14:52:19 +00:00
b07b5bd727
This is not mandated by the standard, so it goes in libcxx/test/libcxx/. It's certainly arguable that the algorithms changed here (`is_heap`, `is_sorted`, `min`, `max`) are harmless and we should just let them copy their comparators once. But at the same time, it's nice to have all our algorithms be 100% consistent and never copy a comparator, not even once. Differential Revision: https://reviews.llvm.org/D114136
56 lines
1.9 KiB
C++
56 lines
1.9 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _LIBCPP___ALGORITHM_BINARY_SEARCH_H
|
|
#define _LIBCPP___ALGORITHM_BINARY_SEARCH_H
|
|
|
|
#include <__config>
|
|
#include <__algorithm/comp.h>
|
|
#include <__algorithm/comp_ref_type.h>
|
|
#include <__algorithm/lower_bound.h>
|
|
#include <__iterator/iterator_traits.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
#pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
template <class _Compare, class _ForwardIterator, class _Tp>
|
|
inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
bool
|
|
__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
|
|
{
|
|
__first = _VSTD::__lower_bound<_Compare>(__first, __last, __value_, __comp);
|
|
return __first != __last && !__comp(__value_, *__first);
|
|
}
|
|
|
|
template <class _ForwardIterator, class _Tp, class _Compare>
|
|
_LIBCPP_NODISCARD_EXT inline
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
bool
|
|
binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
|
|
{
|
|
typedef typename __comp_ref_type<_Compare>::type _Comp_ref;
|
|
return _VSTD::__binary_search<_Comp_ref>(__first, __last, __value_, __comp);
|
|
}
|
|
|
|
template <class _ForwardIterator, class _Tp>
|
|
_LIBCPP_NODISCARD_EXT inline
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
bool
|
|
binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
|
|
{
|
|
return _VSTD::binary_search(__first, __last, __value_,
|
|
__less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>());
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___ALGORITHM_BINARY_SEARCH_H
|