Back to home page

EIC code displayed by LXR

 
 

    


File indexing completed on 2026-05-03 08:13:11

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_RANGES_UPPER_BOUND_H
0010 #define _LIBCPP___ALGORITHM_RANGES_UPPER_BOUND_H
0011 
0012 #include <__algorithm/iterator_operations.h>
0013 #include <__algorithm/lower_bound.h>
0014 #include <__config>
0015 #include <__functional/identity.h>
0016 #include <__functional/invoke.h>
0017 #include <__functional/ranges_operations.h>
0018 #include <__iterator/concepts.h>
0019 #include <__iterator/projected.h>
0020 #include <__ranges/access.h>
0021 #include <__ranges/concepts.h>
0022 #include <__ranges/dangling.h>
0023 
0024 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
0025 #  pragma GCC system_header
0026 #endif
0027 
0028 #if _LIBCPP_STD_VER >= 20
0029 
0030 _LIBCPP_BEGIN_NAMESPACE_STD
0031 
0032 namespace ranges {
0033 struct __upper_bound {
0034   template <forward_iterator _Iter,
0035             sentinel_for<_Iter> _Sent,
0036             class _Type,
0037             class _Proj                                                             = identity,
0038             indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
0039   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter
0040   operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
0041     auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) -> bool {
0042       return !std::invoke(__comp, __rhs, __lhs);
0043     };
0044 
0045     return std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp_lhs_rhs_swapped, __proj);
0046   }
0047 
0048   template <forward_range _Range,
0049             class _Type,
0050             class _Proj                                                                          = identity,
0051             indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
0052   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
0053   operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
0054     auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) -> bool {
0055       return !std::invoke(__comp, __rhs, __lhs);
0056     };
0057 
0058     return std::__lower_bound<_RangeAlgPolicy>(
0059         ranges::begin(__r), ranges::end(__r), __value, __comp_lhs_rhs_swapped, __proj);
0060   }
0061 };
0062 
0063 inline namespace __cpo {
0064 inline constexpr auto upper_bound = __upper_bound{};
0065 } // namespace __cpo
0066 } // namespace ranges
0067 
0068 _LIBCPP_END_NAMESPACE_STD
0069 
0070 #endif // _LIBCPP_STD_VER >= 20
0071 
0072 #endif // _LIBCPP___ALGORITHM_RANGES_UPPER_BOUND_H