mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-14 10:39:05 +00:00
31 lines
1.2 KiB
C++
31 lines
1.2 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2011-2014 Bolero MURAKAMI
|
|
https://github.com/bolero-MURAKAMI/Sprout
|
|
|
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
=============================================================================*/
|
|
#ifndef SPROUT_RANGE_ALGORITHM_FIT_PARTITION_COPY_HPP
|
|
#define SPROUT_RANGE_ALGORITHM_FIT_PARTITION_COPY_HPP
|
|
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/container/functions.hpp>
|
|
#include <sprout/algorithm/fit/results.hpp>
|
|
#include <sprout/algorithm/fit/partition_copy.hpp>
|
|
|
|
namespace sprout {
|
|
namespace range {
|
|
namespace fit {
|
|
//
|
|
// partition_copy
|
|
//
|
|
template<typename InputRange, typename Result, typename Predicate>
|
|
inline SPROUT_CONSTEXPR typename sprout::fit::results::algorithm<Result>::type
|
|
partition_copy(InputRange const& rng, Result const& result, Predicate pred) {
|
|
return sprout::fit::partition_copy(sprout::begin(rng), sprout::end(rng), result, pred);
|
|
}
|
|
} // namespace fit
|
|
} // namespace range
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_RANGE_ALGORITHM_FIT_PARTITION_COPY_HPP
|