mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-02 14:04:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix container_traits for array-like classes

Browse source 
fix coding style algorithm/
This commit is contained in:
bolero-MURAKAMI 2012-09-29 17:10:46 +09:00
parent 06f1933220
commit 0c00166c5f
123 changed files with 1608 additions and 2224 deletions
Download patch file Download diff file Expand all files Collapse all files

70
sprout/algorithm/fixed/stable_partition_copy.hpp
View file

@ -16,11 +16,10 @@ namespace sprout {
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type stable_partition_copy_impl_1(
BidirectionalIterator first,
BidirectionalIterator last,
Result const& result,
Predicate pred,
>::type
stable_partition_copy_impl_1(
BidirectionalIterator first, BidirectionalIterator last,
Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
Args const&... args
)
@ -31,19 +30,24 @@ namespace sprout {
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type stable_partition_copy_impl_1(
BidirectionalIterator first,
BidirectionalIterator last,
Result const& result,
Predicate pred,
>::type
stable_partition_copy_impl_1(
BidirectionalIterator first, BidirectionalIterator last,
Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
Args const&... args
)
{
return first != last && sizeof...(Args) < size
? !pred(*first)
? 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::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...)
;
}
@ -52,11 +56,10 @@ namespace sprout {
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type stable_partition_copy_impl(
BidirectionalIterator first,
BidirectionalIterator last,
Result const& result,
Predicate pred,
>::type
stable_partition_copy_impl(
BidirectionalIterator first, BidirectionalIterator last,
Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
BidirectionalIterator temp_first,
Args const&... args
@ -68,11 +71,10 @@ namespace sprout {
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type stable_partition_copy_impl(
BidirectionalIterator first,
BidirectionalIterator last,
Result const& result,
Predicate pred,
>::type
stable_partition_copy_impl(
BidirectionalIterator first, BidirectionalIterator last,
Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
BidirectionalIterator temp_first,
Args const&... args
@ -80,9 +82,18 @@ namespace sprout {
{
return first != last && sizeof...(Args) < size
? pred(*first)
? 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...)
? 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...
)
;
}
} // namespace detail
@ -90,13 +101,8 @@ namespace sprout {
// stable_partition_copy
//
template<typename BidirectionalIterator, typename Result, typename Predicate>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type stable_partition_copy(
BidirectionalIterator first,
BidirectionalIterator last,
Result const& result,
Predicate pred
)
{
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
stable_partition_copy(BidirectionalIterator first, BidirectionalIterator last, Result const& result, Predicate pred) {
return sprout::fixed::detail::stable_partition_copy_impl(first, last, result, pred, sprout::size(result), first);
}
} // namespace fixed