Warning: This file is not a C or C++ file. It does not have highlighting.
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___ALGORITHM_RANGES_UPPER_BOUND_H |
10 | #define _LIBCPP___ALGORITHM_RANGES_UPPER_BOUND_H |
11 | |
12 | #include <__algorithm/iterator_operations.h> |
13 | #include <__algorithm/lower_bound.h> |
14 | #include <__config> |
15 | #include <__functional/identity.h> |
16 | #include <__functional/invoke.h> |
17 | #include <__functional/ranges_operations.h> |
18 | #include <__iterator/concepts.h> |
19 | #include <__iterator/projected.h> |
20 | #include <__ranges/access.h> |
21 | #include <__ranges/concepts.h> |
22 | #include <__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 | struct __upper_bound { |
34 | template <forward_iterator _Iter, |
35 | sentinel_for<_Iter> _Sent, |
36 | class _Type, |
37 | class _Proj = identity, |
38 | indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less> |
39 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter |
40 | operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const { |
41 | auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) -> bool { |
42 | return !std::invoke(__comp, __rhs, __lhs); |
43 | }; |
44 | |
45 | return std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp_lhs_rhs_swapped, __proj); |
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 borrowed_iterator_t<_Range> |
53 | operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const { |
54 | auto __comp_lhs_rhs_swapped = [&](const auto& __lhs, const auto& __rhs) -> bool { |
55 | return !std::invoke(__comp, __rhs, __lhs); |
56 | }; |
57 | |
58 | return std::__lower_bound<_RangeAlgPolicy>( |
59 | ranges::begin(__r), ranges::end(__r), __value, __comp_lhs_rhs_swapped, __proj); |
60 | } |
61 | }; |
62 | |
63 | inline namespace __cpo { |
64 | inline constexpr auto upper_bound = __upper_bound{}; |
65 | } // namespace __cpo |
66 | } // namespace ranges |
67 | |
68 | _LIBCPP_END_NAMESPACE_STD |
69 | |
70 | #endif // _LIBCPP_STD_VER >= 20 |
71 | |
72 | #endif // _LIBCPP___ALGORITHM_RANGES_UPPER_BOUND_H |
73 |
Warning: This file is not a C or C++ file. It does not have highlighting.