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

extraordinary fix: find_end implementation

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-08-12 00:09:40 +09:00
parent 7c8f28115c
commit 72fe72a623
45 changed files with 68 additions and 171 deletions
Download patch file Download diff file Expand all files Collapse all files

129
sprout/algorithm/find_end.hpp
View file

@ -19,70 +19,71 @@
namespace sprout {
namespace detail {
template<typename RandomAccessIterator1>
inline SPROUT_CONSTEXPR RandomAccessIterator1
find_end_impl_check_ra(RandomAccessIterator1 first1, RandomAccessIterator1 result, RandomAccessIterator1 searched) {
return searched == first1 ? searched
: result
;
}
template<typename RandomAccessIterator1, typename ForwardIterator2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR RandomAccessIterator1
find_end_impl_ra(
RandomAccessIterator1 first1, RandomAccessIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2,
BinaryPredicate pred,
typename std::iterator_traits<RandomAccessIterator1>::difference_type pivot, RandomAccessIterator1 last1_, RandomAccessIterator1 result,
RandomAccessIterator1 searched
)
{
return searched == last1_ ? result
: searched < first1 ? pivot == 0
? sprout::detail::find_end_impl_check_ra(
first1, searched,
sprout::detail::search_one(first1, last1_, first2, last2, pred)
)
: sprout::detail::find_end_impl_ra(
sprout::next(first1, pivot), last1, first2, last2, pred,
(sprout::distance(first1, last1) - pivot) / 2, last1_, searched,
sprout::detail::find_end_impl_ra(
first1, sprout::next(first1, pivot), first2, last2, pred,
pivot / 2, last1_, searched,
first1
)
)
: pivot == 0 ? sprout::detail::search_one(first1, last1_, first2, last2, pred)
: sprout::detail::find_end_impl_ra(
sprout::next(first1, pivot), last1, first2, last2, pred,
(sprout::distance(first1, last1) - pivot) / 2, last1_, result,
sprout::detail::find_end_impl_ra(
first1, sprout::next(first1, pivot), first2, last2, pred,
pivot / 2, last1_, result,
first1
)
)
;
}
template<typename RandomAccessIterator1, typename ForwardIterator2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_constant_distance_iterator<RandomAccessIterator1>::value,
RandomAccessIterator1
>::type
find_end(
RandomAccessIterator1 first1, RandomAccessIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2,
BinaryPredicate pred,
std::random_access_iterator_tag*
)
{
return first1 == last1 ? last1
: sprout::detail::find_end_impl_ra(
first1, last1, first2, last2, pred,
sprout::distance(first1, last1) / 2, last1, last1,
first1
)
;
}
// !!!
// template<typename RandomAccessIterator1>
// inline SPROUT_CONSTEXPR RandomAccessIterator1
// find_end_impl_check_ra(RandomAccessIterator1 first1, RandomAccessIterator1 result, RandomAccessIterator1 searched) {
// return searched == first1 ? searched
// : result
// ;
// }
// template<typename RandomAccessIterator1, typename ForwardIterator2, typename BinaryPredicate>
// inline SPROUT_CONSTEXPR RandomAccessIterator1
// find_end_impl_ra(
// RandomAccessIterator1 first1, RandomAccessIterator1 last1,
// ForwardIterator2 first2, ForwardIterator2 last2,
// BinaryPredicate pred,
// typename std::iterator_traits<RandomAccessIterator1>::difference_type pivot, RandomAccessIterator1 last1_, RandomAccessIterator1 result,
// RandomAccessIterator1 searched
// )
// {
// return searched == last1_ ? result
// : searched < first1 ? pivot == 0
// ? sprout::detail::find_end_impl_check_ra(
// first1, searched,
// sprout::detail::search_one(first1, last1_, first2, last2, pred)
// )
// : sprout::detail::find_end_impl_ra(
// sprout::next(first1, pivot), last1, first2, last2, pred,
// (sprout::distance(first1, last1) - pivot) / 2, last1_, searched,
// sprout::detail::find_end_impl_ra(
// first1, sprout::next(first1, pivot), first2, last2, pred,
// pivot / 2, last1_, searched,
// first1
// )
// )
// : pivot == 0 ? sprout::detail::search_one(first1, last1_, first2, last2, pred)
// : sprout::detail::find_end_impl_ra(
// sprout::next(first1, pivot), last1, first2, last2, pred,
// (sprout::distance(first1, last1) - pivot) / 2, last1_, result,
// sprout::detail::find_end_impl_ra(
// first1, sprout::next(first1, pivot), first2, last2, pred,
// pivot / 2, last1_, result,
// first1
// )
// )
// ;
// }
// template<typename RandomAccessIterator1, typename ForwardIterator2, typename BinaryPredicate>
// inline SPROUT_CONSTEXPR typename std::enable_if<
// sprout::is_constant_distance_iterator<RandomAccessIterator1>::value,
// RandomAccessIterator1
// >::type
// find_end(
// RandomAccessIterator1 first1, RandomAccessIterator1 last1,
// ForwardIterator2 first2, ForwardIterator2 last2,
// BinaryPredicate pred,
// std::random_access_iterator_tag*
// )
// {
// return first1 == last1 ? last1
// : sprout::detail::find_end_impl_ra(
// first1, last1, first2, last2, pred,
// sprout::distance(first1, last1) / 2, last1, last1,
// first1
// )
// ;
// }
template<typename ForwardIterator1>
inline SPROUT_CONSTEXPR sprout::pair<ForwardIterator1, ForwardIterator1>

1
sprout/algorithm/fixed/next_permutation.hpp
View file

@ -14,6 +14,7 @@
#include <sprout/iterator/operation.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/algorithm/fixed/swap_element.hpp>
#include <sprout/algorithm/fixed/reverse_copy.hpp>
#include <sprout/algorithm/fixed/reverse.hpp>
#include <sprout/sub_array/sub_array.hpp>
#include <sprout/utility/pair/pair.hpp>

1
sprout/algorithm/fixed/prev_permutation.hpp
View file

@ -14,6 +14,7 @@
#include <sprout/iterator/operation.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/algorithm/fixed/swap_element.hpp>
#include <sprout/algorithm/fixed/reverse_copy.hpp>
#include <sprout/algorithm/fixed/reverse.hpp>
#include <sprout/sub_array/sub_array.hpp>
#include <sprout/utility/pair/pair.hpp>