mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
50 lines
1.8 KiB
C++
50 lines
1.8 KiB
C++
#ifndef SPROUT_ALGORITHM_FIT_PARTITION_COPY_HPP
|
|
#define SPROUT_ALGORITHM_FIT_PARTITION_COPY_HPP
|
|
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/container/traits.hpp>
|
|
#include <sprout/container/functions.hpp>
|
|
#include <sprout/algorithm/fixed/partition_copy.hpp>
|
|
#include <sprout/algorithm/fit/result_of.hpp>
|
|
#include <sprout/sub_array.hpp>
|
|
#include <sprout/detail/algorithm/count_n_if.hpp>
|
|
#include <sprout/iterator/operation.hpp>
|
|
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
|
|
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
|
|
|
|
namespace sprout {
|
|
namespace fit {
|
|
namespace detail {
|
|
template<typename InputIterator, typename Result, typename Predicate>
|
|
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
|
|
partition_copy_impl(
|
|
InputIterator first, InputIterator last, Result const& result, Predicate pred,
|
|
typename sprout::container_traits<Result>::difference_type offset
|
|
)
|
|
{
|
|
return sprout::sub_copy(
|
|
sprout::get_internal(sprout::fixed::partition_copy(first, last, result, pred)),
|
|
offset,
|
|
offset + sprout::detail::count_n_if(
|
|
first,
|
|
NS_SSCRISK_CEL_OR_SPROUT::min(
|
|
sprout::distance(first, last),
|
|
sprout::size(result)
|
|
),
|
|
pred
|
|
)
|
|
);
|
|
}
|
|
} // namespace detail
|
|
//
|
|
// partition_copy
|
|
//
|
|
template<typename InputIterator, typename Result, typename Predicate>
|
|
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
|
|
partition_copy(InputIterator first, InputIterator last, Result const& result, Predicate pred) {
|
|
return sprout::fit::detail::partition_copy_impl(first, last, result, pred, sprout::internal_begin_offset(result));
|
|
}
|
|
} // namespace fit
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIT_PARTITION_COPY_HPP
|