libcxx/include/__cxx03/__algorithm/ranges_lower_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_LOWER_BOUND_H
  10 #define _LIBCPP___CXX03___ALGORITHM_RANGES_LOWER_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/advance.h>
  19 #include <__cxx03/__iterator/concepts.h>
  20 #include <__cxx03/__iterator/iterator_traits.h>
  21 #include <__cxx03/__iterator/projected.h>
  22 #include <__cxx03/__ranges/access.h>
  23 #include <__cxx03/__ranges/concepts.h>
  24 #include <__cxx03/__ranges/dangling.h>
  25
  26 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
  27 #  pragma GCC system_header
  28 #endif
  29
  30 _LIBCPP_PUSH_MACROS
  31 #include <__cxx03/__undef_macros>
  32
  33 #if _LIBCPP_STD_VER >= 20
  34
  35 _LIBCPP_BEGIN_NAMESPACE_STD
  36
  37 namespace ranges {
  38
  39 namespace __lower_bound {
  40 struct __fn {
  41   template <forward_iterator _Iter,
  42             sentinel_for<_Iter> _Sent,
  43             class _Type,
  44             class _Proj                                                             = identity,
  45             indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
  46   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter
  47   operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
  48     return std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
  49   }
  50
  51   template <forward_range _Range,
  52             class _Type,
  53             class _Proj                                                                          = identity,
  54             indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
  55   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
  56   operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
  57     return std::__lower_bound<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), __value, __comp, __proj);
  58   }
  59 };
  60 } // namespace __lower_bound
  61
  62 inline namespace __cpo {
  63 inline constexpr auto lower_bound = __lower_bound::__fn{};
  64 } // namespace __cpo
  65 } // namespace ranges
  66
  67 _LIBCPP_END_NAMESPACE_STD
  68
  69 #endif // _LIBCPP_STD_VER >= 20
  70
  71 _LIBCPP_POP_MACROS
  72
  73 #endif // _LIBCPP___CXX03___ALGORITHM_RANGES_LOWER_BOUND_H