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 #if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES) 28 29 _LIBCPP_BEGIN_NAMESPACE_STD 30 31 namespace ranges { 32 33 template <class _Iter, class _Sent, class _Proj, class _Comp> 34 _LIBCPP_HIDE_FROM_ABI constexpr 35 _Iter __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { 36 if (__first == __last) 37 return __first; 38 auto __i = __first; 39 while (++__i != __last) { 40 if (std::invoke(__comp, std::invoke(__proj, *__i), std::invoke(__proj, *__first))) 41 return __i; 42 __first = __i; 43 } 44 return __i; 45 } 46 47 namespace __is_sorted_until { 48 struct __fn { 49 template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, 50 class _Proj = identity, 51 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less> 52 _LIBCPP_HIDE_FROM_ABI constexpr 53 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { 54 return ranges::__is_sorted_until_impl(std::move(__first), std::move(__last), __comp, __proj); 55 } 56 57 template <forward_range _Range, 58 class _Proj = identity, 59 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less> 60 _LIBCPP_HIDE_FROM_ABI constexpr 61 borrowed_iterator_t<_Range> operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { 62 return ranges::__is_sorted_until_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj); 63 } 64 }; 65 } // namespace __is_sorted_until 66 67 inline namespace __cpo { 68 inline constexpr auto is_sorted_until = __is_sorted_until::__fn{}; 69 } // namespace __cpo 70 } // namespace ranges 71 72 _LIBCPP_END_NAMESPACE_STD 73 74 #endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES) 75 76 #endif // _LIBCPP__ALGORITHM_RANGES_IS_SORTED_UNTIL_H 77