libcxx/include/__cxx03/__algorithm/ranges_upper_bound.h

   1 //===----------------------------------------------------------------------===//
   2 //
   3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
   4 // See https://llvm.org/LICENSE.txt for license information.
   5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
   6 //
   7 //===----------------------------------------------------------------------===//
   8
   9 #ifndef _LIBCPP___CXX03___ALGORITHM_RANGES_UPPER_BOUND_H
  10 #define _LIBCPP___CXX03___ALGORITHM_RANGES_UPPER_BOUND_H
  11
  12 #include <__cxx03/__algorithm/iterator_operations.h>
  13 #include <__cxx03/__algorithm/lower_bound.h>
  14 #include <__cxx03/__config>
  15 #include <__cxx03/__functional/identity.h>
  16 #include <__cxx03/__functional/invoke.h>
  17 #include <__cxx03/__functional/ranges_operations.h>
  18 #include <__cxx03/__iterator/concepts.h>
  19 #include <__cxx03/__iterator/projected.h>
  20 #include <__cxx03/__ranges/access.h>
  21 #include <__cxx03/__ranges/concepts.h>
  22 #include <__cxx03/__ranges/dangling.h>
  23
  24 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
  25 #  pragma GCC system_header
  26 #endif
  27
  28 #if _LIBCPP_STD_VER >= 20
  29
  30 _LIBCPP_BEGIN_NAMESPACE_STD
  31
  32 namespace ranges {
  33 namespace __upper_bound {
  34 struct __fn {
  35   template <forward_iterator _Iter,
  36             sentinel_for<_Iter> _Sent,
  37             class _Type,
  38             class _Proj                                                             = identity,
  39             indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
  40   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter
  41   operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
  42     auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) -> bool {
  43       return !std::invoke(__comp, __rhs, __lhs);
  44     };
  45
  46     return std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp_lhs_rhs_swapped, __proj);
  47   }
  48
  49   template <forward_range _Range,
  50             class _Type,
  51             class _Proj                                                                          = identity,
  52             indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
  53   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
  54   operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
  55     auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) -> bool {
  56       return !std::invoke(__comp, __rhs, __lhs);
  57     };
  58
  59     return std::__lower_bound<_RangeAlgPolicy>(
  60         ranges::begin(__r), ranges::end(__r), __value, __comp_lhs_rhs_swapped, __proj);
  61   }
  62 };
  63 } // namespace __upper_bound
  64
  65 inline namespace __cpo {
  66 inline constexpr auto upper_bound = __upper_bound::__fn{};
  67 } // namespace __cpo
  68 } // namespace ranges
  69
  70 _LIBCPP_END_NAMESPACE_STD
  71
  72 #endif // _LIBCPP_STD_VER >= 20
  73
  74 #endif // _LIBCPP___CXX03___ALGORITHM_RANGES_UPPER_BOUND_H