1 //===----------------------------------------------------------------------===//
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
7 //===----------------------------------------------------------------------===//
9 #ifndef _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_COPY_H
10 #define _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_COPY_H
12 #include <__algorithm/in_out_result.h>
13 #include <__algorithm/make_projected.h>
14 #include <__algorithm/partial_sort_copy.h>
16 #include <__functional/identity.h>
17 #include <__functional/invoke.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/forward.h>
27 #include <__utility/move.h>
29 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
30 # pragma GCC system_header
33 #if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
35 _LIBCPP_BEGIN_NAMESPACE_STD
39 template <class _InIter, class _OutIter>
40 using partial_sort_copy_result = in_out_result<_InIter, _OutIter>;
42 namespace __partial_sort_copy {
46 template <input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
47 random_access_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
48 class _Comp = ranges::less, class _Proj1 = identity, class _Proj2 = identity>
49 requires indirectly_copyable<_Iter1, _Iter2> && sortable<_Iter2, _Comp, _Proj2> &&
50 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>>
51 _LIBCPP_HIDE_FROM_ABI constexpr
52 partial_sort_copy_result<_Iter1, _Iter2>
53 operator()(_Iter1 __first, _Sent1 __last, _Iter2 __result_first, _Sent2 __result_last,
54 _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
56 (void)__first; (void)__last; (void)__result_first; (void)__result_last; (void)__comp; (void)__proj1; (void)__proj2;
60 template <input_range _Range1, random_access_range _Range2, class _Comp = ranges::less,
61 class _Proj1 = identity, class _Proj2 = identity>
62 requires indirectly_copyable<iterator_t<_Range1>, iterator_t<_Range2>> &&
63 sortable<iterator_t<_Range2>, _Comp, _Proj2> &&
64 indirect_strict_weak_order<_Comp, projected<iterator_t<_Range1>, _Proj1>,
65 projected<iterator_t<_Range2>, _Proj2>>
66 _LIBCPP_HIDE_FROM_ABI constexpr
67 partial_sort_copy_result<borrowed_iterator_t<_Range1>, borrowed_iterator_t<_Range2>>
68 operator()(_Range1&& __range, _Range2&& __result_range, _Comp __comp = {},
69 _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
71 (void)__range; (void)__result_range; (void)__comp; (void)__proj1; (void)__proj2;
77 } // namespace __partial_sort_copy
79 inline namespace __cpo {
80 inline constexpr auto partial_sort_copy = __partial_sort_copy::__fn{};
84 _LIBCPP_END_NAMESPACE_STD
86 #endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
88 #endif // _LIBCPP___ALGORITHM_RANGES_PARTIAL_SORT_COPY_H