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_IS_SORTED_UNTIL_H
10 #define _LIBCPP__ALGORITHM_RANGES_IS_SORTED_UNTIL_H
11
12 #include <__config>
13 #include <__functional/identity.h>
14 #include <__functional/invoke.h>
15 #include <__functional/ranges_operations.h>
16 #include <__iterator/concepts.h>
17 #include <__iterator/projected.h>
18 #include <__ranges/access.h>
19 #include <__ranges/concepts.h>
20 #include <__ranges/dangling.h>
21 #include <__utility/move.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 <__undef_macros>
29
30 #if _LIBCPP_STD_VER >= 20
31
32 _LIBCPP_BEGIN_NAMESPACE_STD
33
34 namespace ranges {
35
36 template <class _Iter, class _Sent, class _Proj, class _Comp>
37 _LIBCPP_HIDE_FROM_ABI constexpr _Iter
__is_sorted_until_impl(_Iter __first,_Sent __last,_Comp & __comp,_Proj & __proj)38 __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
39 if (__first == __last)
40 return __first;
41 auto __i = __first;
42 while (++__i != __last) {
43 if (std::invoke(__comp, std::invoke(__proj, *__i), std::invoke(__proj, *__first)))
44 return __i;
45 __first = __i;
46 }
47 return __i;
48 }
49
50 namespace __is_sorted_until {
51 struct __fn {
52 template <forward_iterator _Iter,
53 sentinel_for<_Iter> _Sent,
54 class _Proj = identity,
55 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
56 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter
operator__fn57 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
58 return ranges::__is_sorted_until_impl(std::move(__first), std::move(__last), __comp, __proj);
59 }
60
61 template <forward_range _Range,
62 class _Proj = identity,
63 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
64 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
operator__fn65 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
66 return ranges::__is_sorted_until_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
67 }
68 };
69 } // namespace __is_sorted_until
70
71 inline namespace __cpo {
72 inline constexpr auto is_sorted_until = __is_sorted_until::__fn{};
73 } // namespace __cpo
74 } // namespace ranges
75
76 _LIBCPP_END_NAMESPACE_STD
77
78 #endif // _LIBCPP_STD_VER >= 20
79
80 _LIBCPP_POP_MACROS
81
82 #endif // _LIBCPP__ALGORITHM_RANGES_IS_SORTED_UNTIL_H
83