Sprout/sprout/algorithm/fit/partition.hpp

42 lines
1.4 KiB
C++
Raw Normal View History

2011-09-03 13:26:26 +00:00
#ifndef SPROUT_ALGORITHM_FIT_PARTITION_HPP
#define SPROUT_ALGORITHM_FIT_PARTITION_HPP
#include <sprout/config.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/partition.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/sub_array/sub_array.hpp>
#include <sprout/sub_array/sub.hpp>
2013-02-19 16:12:56 +00:00
#include HDR_ALGORITHM_MIN_MAX_SSCRISK_CEL_OR_SPROUT
2011-09-03 13:26:26 +00:00
namespace sprout {
namespace fit {
namespace detail {
template<typename Container, typename Predicate>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
partition_impl(
Container const& cont, Predicate pred,
typename sprout::container_traits<Container>::difference_type offset
2011-09-03 13:26:26 +00:00
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::partition(cont, pred)),
2011-09-03 13:26:26 +00:00
offset,
2012-04-01 13:15:09 +00:00
offset + sprout::size(cont) - NS_SSCRISK_CEL_OR_SPROUT::count_if(sprout::begin(cont), sprout::end(cont), pred)
2011-09-03 13:26:26 +00:00
);
}
} // namespace detail
//
// partition
//
template<typename Container, typename Predicate>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
partition(Container const& cont, Predicate pred) {
return sprout::fit::detail::partition_impl(cont, pred, sprout::internal_begin_offset(cont));
2011-09-03 13:26:26 +00:00
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_PARTITION_HPP