1*4bdff4beSrobert //===----------------------------------------------------------------------===// 2*4bdff4beSrobert // 3*4bdff4beSrobert // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4*4bdff4beSrobert // See https://llvm.org/LICENSE.txt for license information. 5*4bdff4beSrobert // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6*4bdff4beSrobert // 7*4bdff4beSrobert //===----------------------------------------------------------------------===// 8*4bdff4beSrobert 9*4bdff4beSrobert #ifndef _LIBCPP___ALGORITHM_RANGES_PARTITION_COPY_H 10*4bdff4beSrobert #define _LIBCPP___ALGORITHM_RANGES_PARTITION_COPY_H 11*4bdff4beSrobert 12*4bdff4beSrobert #include <__algorithm/in_out_out_result.h> 13*4bdff4beSrobert #include <__config> 14*4bdff4beSrobert #include <__functional/identity.h> 15*4bdff4beSrobert #include <__functional/invoke.h> 16*4bdff4beSrobert #include <__iterator/concepts.h> 17*4bdff4beSrobert #include <__iterator/iterator_traits.h> 18*4bdff4beSrobert #include <__iterator/projected.h> 19*4bdff4beSrobert #include <__ranges/access.h> 20*4bdff4beSrobert #include <__ranges/concepts.h> 21*4bdff4beSrobert #include <__ranges/dangling.h> 22*4bdff4beSrobert #include <__utility/move.h> 23*4bdff4beSrobert #include <type_traits> 24*4bdff4beSrobert 25*4bdff4beSrobert #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 26*4bdff4beSrobert # pragma GCC system_header 27*4bdff4beSrobert #endif 28*4bdff4beSrobert 29*4bdff4beSrobert #if _LIBCPP_STD_VER > 17 30*4bdff4beSrobert 31*4bdff4beSrobert _LIBCPP_BEGIN_NAMESPACE_STD 32*4bdff4beSrobert 33*4bdff4beSrobert namespace ranges { 34*4bdff4beSrobert 35*4bdff4beSrobert template <class _InIter, class _OutIter1, class _OutIter2> 36*4bdff4beSrobert using partition_copy_result = in_out_out_result<_InIter, _OutIter1, _OutIter2>; 37*4bdff4beSrobert 38*4bdff4beSrobert namespace __partition_copy { 39*4bdff4beSrobert 40*4bdff4beSrobert struct __fn { 41*4bdff4beSrobert 42*4bdff4beSrobert // TODO(ranges): delegate to the classic algorithm. 43*4bdff4beSrobert template <class _InIter, class _Sent, class _OutIter1, class _OutIter2, class _Proj, class _Pred> 44*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI constexpr 45*4bdff4beSrobert static partition_copy_result< 46*4bdff4beSrobert __remove_cvref_t<_InIter>, __remove_cvref_t<_OutIter1>, __remove_cvref_t<_OutIter2> __partition_copy_fn_impl__fn47*4bdff4beSrobert > __partition_copy_fn_impl( _InIter&& __first, _Sent&& __last, _OutIter1&& __out_true, _OutIter2&& __out_false, 48*4bdff4beSrobert _Pred& __pred, _Proj& __proj) { 49*4bdff4beSrobert for (; __first != __last; ++__first) { 50*4bdff4beSrobert if (std::invoke(__pred, std::invoke(__proj, *__first))) { 51*4bdff4beSrobert *__out_true = *__first; 52*4bdff4beSrobert ++__out_true; 53*4bdff4beSrobert 54*4bdff4beSrobert } else { 55*4bdff4beSrobert *__out_false = *__first; 56*4bdff4beSrobert ++__out_false; 57*4bdff4beSrobert } 58*4bdff4beSrobert } 59*4bdff4beSrobert 60*4bdff4beSrobert return {std::move(__first), std::move(__out_true), std::move(__out_false)}; 61*4bdff4beSrobert } 62*4bdff4beSrobert 63*4bdff4beSrobert template <input_iterator _InIter, sentinel_for<_InIter> _Sent, 64*4bdff4beSrobert weakly_incrementable _OutIter1, weakly_incrementable _OutIter2, 65*4bdff4beSrobert class _Proj = identity, indirect_unary_predicate<projected<_InIter, _Proj>> _Pred> 66*4bdff4beSrobert requires indirectly_copyable<_InIter, _OutIter1> && indirectly_copyable<_InIter, _OutIter2> 67*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI constexpr 68*4bdff4beSrobert partition_copy_result<_InIter, _OutIter1, _OutIter2> operator__fn69*4bdff4beSrobert operator()(_InIter __first, _Sent __last, _OutIter1 __out_true, _OutIter2 __out_false, 70*4bdff4beSrobert _Pred __pred, _Proj __proj = {}) const { 71*4bdff4beSrobert return __partition_copy_fn_impl( 72*4bdff4beSrobert std::move(__first), std::move(__last), std::move(__out_true), std::move(__out_false), __pred, __proj); 73*4bdff4beSrobert } 74*4bdff4beSrobert 75*4bdff4beSrobert template <input_range _Range, weakly_incrementable _OutIter1, weakly_incrementable _OutIter2, 76*4bdff4beSrobert class _Proj = identity, indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred> 77*4bdff4beSrobert requires indirectly_copyable<iterator_t<_Range>, _OutIter1> && indirectly_copyable<iterator_t<_Range>, _OutIter2> 78*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI constexpr 79*4bdff4beSrobert partition_copy_result<borrowed_iterator_t<_Range>, _OutIter1, _OutIter2> operator__fn80*4bdff4beSrobert operator()(_Range&& __range, _OutIter1 __out_true, _OutIter2 __out_false, _Pred __pred, _Proj __proj = {}) const { 81*4bdff4beSrobert return __partition_copy_fn_impl( 82*4bdff4beSrobert ranges::begin(__range), ranges::end(__range), std::move(__out_true), std::move(__out_false), __pred, __proj); 83*4bdff4beSrobert } 84*4bdff4beSrobert 85*4bdff4beSrobert }; 86*4bdff4beSrobert 87*4bdff4beSrobert } // namespace __partition_copy 88*4bdff4beSrobert 89*4bdff4beSrobert inline namespace __cpo { 90*4bdff4beSrobert inline constexpr auto partition_copy = __partition_copy::__fn{}; 91*4bdff4beSrobert } // namespace __cpo 92*4bdff4beSrobert } // namespace ranges 93*4bdff4beSrobert 94*4bdff4beSrobert _LIBCPP_END_NAMESPACE_STD 95*4bdff4beSrobert 96*4bdff4beSrobert #endif // _LIBCPP_STD_VER > 17 97*4bdff4beSrobert 98*4bdff4beSrobert #endif // _LIBCPP___ALGORITHM_RANGES_PARTITION_COPY_H 99