__cxx03/__algorithm/ranges_upper_bound.h

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