libcxx/include/__cxx03/__algorithm/ranges_binary_search.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_BINARY_SEARCH_H
  10 #define _LIBCPP___CXX03___ALGORITHM_RANGES_BINARY_SEARCH_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
  23 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
  24 #  pragma GCC system_header
  25 #endif
  26
  27 _LIBCPP_PUSH_MACROS
  28 #include <__cxx03/__undef_macros>
  29
  30 #if _LIBCPP_STD_VER >= 20
  31
  32 _LIBCPP_BEGIN_NAMESPACE_STD
  33
  34 namespace ranges {
  35 namespace __binary_search {
  36 struct __fn {
  37   template <forward_iterator _Iter,
  38             sentinel_for<_Iter> _Sent,
  39             class _Type,
  40             class _Proj                                                             = identity,
  41             indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
  42   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool
  43   operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
  44     auto __ret = std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
  45     return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret));
  46   }
  47
  48   template <forward_range _Range,
  49             class _Type,
  50             class _Proj                                                                          = identity,
  51             indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
  52   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool
  53   operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const {
  54     auto __first = ranges::begin(__r);
  55     auto __last  = ranges::end(__r);
  56     auto __ret   = std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
  57     return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret));
  58   }
  59 };
  60 } // namespace __binary_search
  61
  62 inline namespace __cpo {
  63 inline constexpr auto binary_search = __binary_search::__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_BINARY_SEARCH_H