2022-06-06 03:15:16 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// 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_RANGES_LOWER_BOUND_H
|
|
|
|
#define _LIBCPP___ALGORITHM_RANGES_LOWER_BOUND_H
|
|
|
|
|
2022-06-13 16:43:43 +08:00
|
|
|
#include <__algorithm/iterator_operations.h>
|
2022-06-06 03:15:16 +08:00
|
|
|
#include <__algorithm/lower_bound.h>
|
|
|
|
#include <__config>
|
|
|
|
#include <__functional/identity.h>
|
|
|
|
#include <__functional/invoke.h>
|
|
|
|
#include <__functional/ranges_operations.h>
|
|
|
|
#include <__iterator/advance.h>
|
|
|
|
#include <__iterator/concepts.h>
|
|
|
|
#include <__iterator/iterator_traits.h>
|
|
|
|
#include <__iterator/projected.h>
|
|
|
|
#include <__ranges/access.h>
|
|
|
|
#include <__ranges/concepts.h>
|
|
|
|
#include <__ranges/dangling.h>
|
|
|
|
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
|
|
# pragma GCC system_header
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
|
|
|
|
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
|
|
|
|
namespace ranges {
|
|
|
|
|
|
|
|
namespace __lower_bound {
|
|
|
|
struct __fn {
|
|
|
|
template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity,
|
|
|
|
indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
|
|
|
|
_LIBCPP_HIDE_FROM_ABI constexpr
|
|
|
|
_Iter operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
|
2022-06-13 16:43:43 +08:00
|
|
|
return std::__lower_bound_impl<_RangesIterOps>(__first, __last, __value, __comp, __proj);
|
2022-06-06 03:15:16 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
template <forward_range _Range, class _Type, class _Proj = identity,
|
|
|
|
indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
|
|
|
|
_LIBCPP_HIDE_FROM_ABI constexpr
|
|
|
|
borrowed_iterator_t<_Range> operator()(_Range&& __r,
|
|
|
|
const _Type& __value,
|
|
|
|
_Comp __comp = {},
|
|
|
|
_Proj __proj = {}) const {
|
2022-06-13 16:43:43 +08:00
|
|
|
return std::__lower_bound_impl<_RangesIterOps>(ranges::begin(__r), ranges::end(__r), __value, __comp, __proj);
|
2022-06-06 03:15:16 +08:00
|
|
|
}
|
|
|
|
};
|
|
|
|
} // namespace __lower_bound
|
|
|
|
|
|
|
|
inline namespace __cpo {
|
|
|
|
inline constexpr auto lower_bound = __lower_bound::__fn{};
|
|
|
|
} // namespace __cpo
|
|
|
|
} // namespace ranges
|
|
|
|
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
|
|
|
|
#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
|
|
|
|
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_LOWER_BOUND_H
|