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_PARTIAL_SORT_COPY_H 10 #define _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_COPY_H 11 12 #include <__algorithm/in_out_result.h> 13 #include <__algorithm/iterator_operations.h> 14 #include <__algorithm/make_projected.h> 15 #include <__algorithm/partial_sort_copy.h> 16 #include <__config> 17 #include <__functional/identity.h> 18 #include <__functional/ranges_operations.h> 19 #include <__iterator/concepts.h> 20 #include <__iterator/iterator_traits.h> 21 #include <__iterator/projected.h> 22 #include <__iterator/sortable.h> 23 #include <__ranges/access.h> 24 #include <__ranges/concepts.h> 25 #include <__ranges/dangling.h> 26 #include <__utility/move.h> 27 #include <__utility/pair.h> 28 29 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 30 # pragma GCC system_header 31 #endif 32 33 #if _LIBCPP_STD_VER >= 20 34 35 _LIBCPP_BEGIN_NAMESPACE_STD 36 37 namespace ranges { 38 39 template <class _InIter, class _OutIter> 40 using partial_sort_copy_result = in_out_result<_InIter, _OutIter>; 41 42 namespace __partial_sort_copy { 43 44 struct __fn { 45 template <input_iterator _Iter1, 46 sentinel_for<_Iter1> _Sent1, 47 random_access_iterator _Iter2, 48 sentinel_for<_Iter2> _Sent2, 49 class _Comp = ranges::less, 50 class _Proj1 = identity, 51 class _Proj2 = identity> 52 requires indirectly_copyable<_Iter1, _Iter2> && sortable<_Iter2, _Comp, _Proj2> && 53 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> 54 _LIBCPP_HIDE_FROM_ABI constexpr partial_sort_copy_result<_Iter1, _Iter2> operator()( 55 _Iter1 __first, 56 _Sent1 __last, 57 _Iter2 __result_first, 58 _Sent2 __result_last, 59 _Comp __comp = {}, 60 _Proj1 __proj1 = {}, 61 _Proj2 __proj2 = {}) const { 62 auto __result = std::__partial_sort_copy<_RangeAlgPolicy>( 63 std::move(__first), 64 std::move(__last), 65 std::move(__result_first), 66 std::move(__result_last), 67 __comp, 68 __proj1, 69 __proj2); 70 return {std::move(__result.first), std::move(__result.second)}; 71 } 72 73 template <input_range _Range1, 74 random_access_range _Range2, 75 class _Comp = ranges::less, 76 class _Proj1 = identity, 77 class _Proj2 = identity> 78 requires indirectly_copyable<iterator_t<_Range1>, iterator_t<_Range2>> && 79 sortable<iterator_t<_Range2>, _Comp, _Proj2> && 80 indirect_strict_weak_order<_Comp, 81 projected<iterator_t<_Range1>, _Proj1>, 82 projected<iterator_t<_Range2>, _Proj2>> 83 _LIBCPP_HIDE_FROM_ABI constexpr partial_sort_copy_result<borrowed_iterator_t<_Range1>, borrowed_iterator_t<_Range2>> 84 operator()( 85 _Range1&& __range, _Range2&& __result_range, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { 86 auto __result = std::__partial_sort_copy<_RangeAlgPolicy>( 87 ranges::begin(__range), 88 ranges::end(__range), 89 ranges::begin(__result_range), 90 ranges::end(__result_range), 91 __comp, 92 __proj1, 93 __proj2); 94 return {std::move(__result.first), std::move(__result.second)}; 95 } 96 }; 97 98 } // namespace __partial_sort_copy 99 100 inline namespace __cpo { 101 inline constexpr auto partial_sort_copy = __partial_sort_copy::__fn{}; 102 } // namespace __cpo 103 } // namespace ranges 104 105 _LIBCPP_END_NAMESPACE_STD 106 107 #endif // _LIBCPP_STD_VER >= 20 108 109 #endif // _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_COPY_H 110