mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-04-16 05:10:32 +00:00
5aaefa510e
libc++ has started splicing standard library headers into much more fine-grained content for maintainability. It's very likely that outdated and naive tooling (some of which is outside of LLVM's scope) will suggest users include things such as <__ranges/access.h> instead of <ranges>, and Hyrum's law suggests that users will eventually begin to rely on this without the help of tooling. As such, this commit intends to protect users from themselves, by making it a hard error for anyone outside of the standard library to include libc++ detail headers. Differential Revision: https://reviews.llvm.org/D106124
68 lines
2.2 KiB
C++
68 lines
2.2 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_LOWER_BOUND_H
|
|
#define _LIBCPP___ALGORITHM_LOWER_BOUND_H
|
|
|
|
#include <__algorithm/comp.h>
|
|
#include <__algorithm/half_positive.h>
|
|
#include <__config>
|
|
#include <iterator>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
# pragma clang include_instead(<algorithm>)
|
|
#endif
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
template <class _Compare, class _ForwardIterator, class _Tp>
|
|
_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator
|
|
__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
|
|
{
|
|
typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type;
|
|
difference_type __len = _VSTD::distance(__first, __last);
|
|
while (__len != 0)
|
|
{
|
|
difference_type __l2 = _VSTD::__half_positive(__len);
|
|
_ForwardIterator __m = __first;
|
|
_VSTD::advance(__m, __l2);
|
|
if (__comp(*__m, __value_))
|
|
{
|
|
__first = ++__m;
|
|
__len -= __l2 + 1;
|
|
}
|
|
else
|
|
__len = __l2;
|
|
}
|
|
return __first;
|
|
}
|
|
|
|
template <class _ForwardIterator, class _Tp, class _Compare>
|
|
_LIBCPP_NODISCARD_EXT inline
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
_ForwardIterator
|
|
lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
|
|
{
|
|
return _VSTD::__lower_bound<_Compare&>(__first, __last, __value_, __comp);
|
|
}
|
|
|
|
template <class _ForwardIterator, class _Tp>
|
|
_LIBCPP_NODISCARD_EXT inline
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
_ForwardIterator
|
|
lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
|
|
{
|
|
return _VSTD::lower_bound(__first, __last, __value_,
|
|
__less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>());
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___ALGORITHM_LOWER_BOUND_H
|