Sprout/sprout/algorithm/fixed/stable_partition_copy.hpp

108 lines
4.4 KiB
C++
Raw Normal View History

2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_STABLE_PARTITION_COPY_HPP
#define SPROUT_ALGORITHM_FIXED_STABLE_PARTITION_COPY_HPP
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/fixed_container/traits.hpp>
#include <sprout/fixed_container/functions.hpp>
#include <sprout/iterator/operation.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/result_of.hpp>
2011-10-28 14:28:24 +00:00
#include <sprout/detail/container_complate.hpp>
2011-09-01 02:48:32 +00:00
namespace sprout {
namespace fixed {
namespace detail {
template<typename BidirectionalIterator, typename Result, typename Predicate, typename... Args>
2011-09-01 02:48:32 +00:00
SPROUT_CONSTEXPR inline typename std::enable_if<
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
2011-10-28 14:28:24 +00:00
>::type stable_partition_copy_impl_1(
BidirectionalIterator first,
BidirectionalIterator last,
2011-09-01 02:48:32 +00:00
Result const& result,
Predicate pred,
2011-10-28 14:28:24 +00:00
typename sprout::fixed_container_traits<Result>::size_type size,
2011-09-01 02:48:32 +00:00
Args const&... args
)
{
2011-10-30 08:40:35 +00:00
return sprout::remake_clone<Result>(result, sprout::size(result), args...);
2011-09-01 02:48:32 +00:00
}
template<typename BidirectionalIterator, typename Result, typename Predicate, typename... Args>
2011-09-01 02:48:32 +00:00
SPROUT_CONSTEXPR inline typename std::enable_if<
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
2011-10-28 14:28:24 +00:00
>::type stable_partition_copy_impl_1(
BidirectionalIterator first,
BidirectionalIterator last,
2011-09-01 02:48:32 +00:00
Result const& result,
Predicate pred,
2011-10-28 14:28:24 +00:00
typename sprout::fixed_container_traits<Result>::size_type size,
2011-09-01 02:48:32 +00:00
Args const&... args
)
{
2011-10-28 14:28:24 +00:00
return first != last && sizeof...(Args) < size
2011-09-01 02:48:32 +00:00
? !pred(*first)
2011-10-28 14:28:24 +00:00
? sprout::fixed::detail::stable_partition_copy_impl_1(sprout::next(first), last, result, pred, size, args..., *first)
: sprout::fixed::detail::stable_partition_copy_impl_1(sprout::next(first), last, result, pred, size, args...)
: sprout::detail::container_complate(result, args...)
2011-09-01 02:48:32 +00:00
;
}
template<typename BidirectionalIterator, typename Result, typename Predicate, typename... Args>
2011-09-01 02:48:32 +00:00
SPROUT_CONSTEXPR inline typename std::enable_if<
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
2011-10-28 14:28:24 +00:00
>::type stable_partition_copy_impl(
BidirectionalIterator first,
BidirectionalIterator last,
2011-09-01 02:48:32 +00:00
Result const& result,
Predicate pred,
2011-10-28 14:28:24 +00:00
typename sprout::fixed_container_traits<Result>::size_type size,
BidirectionalIterator temp_first,
2011-09-01 02:48:32 +00:00
Args const&... args
)
{
2011-10-30 08:40:35 +00:00
return sprout::remake_clone<Result>(result, sprout::size(result), args...);
2011-09-01 02:48:32 +00:00
}
template<typename BidirectionalIterator, typename Result, typename Predicate, typename... Args>
2011-09-01 02:48:32 +00:00
SPROUT_CONSTEXPR inline typename std::enable_if<
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
2011-10-28 14:28:24 +00:00
>::type stable_partition_copy_impl(
BidirectionalIterator first,
BidirectionalIterator last,
2011-09-01 02:48:32 +00:00
Result const& result,
Predicate pred,
2011-10-28 14:28:24 +00:00
typename sprout::fixed_container_traits<Result>::size_type size,
BidirectionalIterator temp_first,
2011-09-01 02:48:32 +00:00
Args const&... args
)
{
2011-10-28 14:28:24 +00:00
return first != last && sizeof...(Args) < size
2011-09-01 02:48:32 +00:00
? pred(*first)
2011-10-28 14:28:24 +00:00
? sprout::fixed::detail::stable_partition_copy_impl(sprout::next(first), last, result, pred, size, temp_first, args..., *first)
: sprout::fixed::detail::stable_partition_copy_impl(sprout::next(first), last, result, pred, size, temp_first, args...)
: sprout::fixed::detail::stable_partition_copy_impl_1(temp_first, last, result, pred, size, args...)
2011-09-01 02:48:32 +00:00
;
}
} // namespace detail
//
// stable_partition_copy
//
template<typename BidirectionalIterator, typename Result, typename Predicate>
2011-09-03 13:26:26 +00:00
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type stable_partition_copy(
BidirectionalIterator first,
BidirectionalIterator last,
2011-09-01 02:48:32 +00:00
Result const& result,
Predicate pred
)
{
2011-10-28 14:28:24 +00:00
return sprout::fixed::detail::stable_partition_copy_impl(first, last, result, pred, sprout::size(result), first);
2011-09-01 02:48:32 +00:00
}
} // namespace fixed
2011-09-03 13:26:26 +00:00
using sprout::fixed::stable_partition_copy;
2011-09-01 02:48:32 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_STABLE_PARTITION_COPY_HPP