2012-04-01 13:15:09 +00:00
|
|
|
#ifndef SPROUT_ALGORITHM_FIND_END_HPP
|
|
|
|
#define SPROUT_ALGORITHM_FIND_END_HPP
|
|
|
|
|
|
|
|
#include <sprout/config.hpp>
|
|
|
|
#include <sprout/iterator/operation.hpp>
|
|
|
|
#include <sprout/algorithm/search.hpp>
|
2012-12-11 16:47:14 +00:00
|
|
|
#include <sprout/functional/equal_to.hpp>
|
2012-12-13 04:03:18 +00:00
|
|
|
#include <sprout/detail/algorithm/search_one.hpp>
|
2012-12-15 08:41:20 +00:00
|
|
|
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT
|
2012-04-01 13:15:09 +00:00
|
|
|
|
|
|
|
namespace sprout {
|
2012-12-11 03:59:36 +00:00
|
|
|
namespace detail {
|
2012-12-15 08:41:20 +00:00
|
|
|
template<typename RandomAccessIterator1>
|
|
|
|
inline SPROUT_CONSTEXPR RandomAccessIterator1
|
|
|
|
find_end_impl_ra_1(RandomAccessIterator1 first1, RandomAccessIterator1 result, RandomAccessIterator1 searched) {
|
|
|
|
return searched == first1 ? searched
|
|
|
|
: result
|
|
|
|
;
|
|
|
|
}
|
2012-12-13 04:03:18 +00:00
|
|
|
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
|
|
|
|
)
|
|
|
|
{
|
2012-12-15 08:41:20 +00:00
|
|
|
return searched == last1_ ? result
|
|
|
|
: searched < first1 ? pivot == 0
|
|
|
|
? sprout::detail::find_end_impl_ra_1(
|
|
|
|
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,
|
|
|
|
(NS_SSCRISK_CEL_OR_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
|
|
|
|
)
|
2012-12-13 04:03:18 +00:00
|
|
|
)
|
|
|
|
: 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,
|
|
|
|
(NS_SSCRISK_CEL_OR_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 RandomAccessIterator1
|
|
|
|
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,
|
|
|
|
NS_SSCRISK_CEL_OR_SPROUT::distance(first1, last1) / 2, last1, last1,
|
|
|
|
first1
|
|
|
|
)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
2012-12-11 03:59:36 +00:00
|
|
|
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate>
|
|
|
|
inline SPROUT_CONSTEXPR ForwardIterator1
|
|
|
|
find_end_impl(
|
|
|
|
ForwardIterator1 first1, ForwardIterator1 last1,
|
|
|
|
ForwardIterator2 first2, ForwardIterator2 last2,
|
|
|
|
BinaryPredicate pred,
|
|
|
|
ForwardIterator1 result
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return first1 == last1 ? result
|
|
|
|
: sprout::detail::find_end_impl(
|
|
|
|
sprout::search(sprout::next(first1), last1, first2, last2, pred), last1, first2, last2, pred,
|
2012-12-13 04:03:18 +00:00
|
|
|
first1
|
2012-12-11 03:59:36 +00:00
|
|
|
)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate>
|
|
|
|
inline SPROUT_CONSTEXPR ForwardIterator1
|
|
|
|
find_end(
|
|
|
|
ForwardIterator1 first1, ForwardIterator1 last1,
|
|
|
|
ForwardIterator2 first2, ForwardIterator2 last2,
|
|
|
|
BinaryPredicate pred,
|
|
|
|
void*
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return first2 == last2 ? last1
|
|
|
|
: sprout::detail::find_end_impl(
|
|
|
|
sprout::search(first1, last1, first2, last2, pred), last1, first2, last2, pred,
|
|
|
|
last1
|
|
|
|
)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
} // namespace detail
|
|
|
|
|
2012-04-01 13:15:09 +00:00
|
|
|
// 25.2.6 Find end
|
|
|
|
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate>
|
2012-10-06 04:53:07 +00:00
|
|
|
inline SPROUT_CONSTEXPR ForwardIterator1
|
|
|
|
find_end(
|
|
|
|
ForwardIterator1 first1, ForwardIterator1 last1,
|
|
|
|
ForwardIterator2 first2, ForwardIterator2 last2,
|
2012-04-01 13:15:09 +00:00
|
|
|
BinaryPredicate pred
|
|
|
|
)
|
|
|
|
{
|
2012-12-11 03:59:36 +00:00
|
|
|
typedef typename std::iterator_traits<ForwardIterator1>::iterator_category* category;
|
|
|
|
return sprout::detail::find_end(first1, last1, first2, last2, pred, category());
|
2012-04-01 13:15:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template<typename ForwardIterator1, typename ForwardIterator2>
|
2012-10-06 04:53:07 +00:00
|
|
|
inline SPROUT_CONSTEXPR ForwardIterator1
|
|
|
|
find_end(
|
|
|
|
ForwardIterator1 first1, ForwardIterator1 last1,
|
|
|
|
ForwardIterator2 first2, ForwardIterator2 last2
|
2012-04-01 13:15:09 +00:00
|
|
|
)
|
|
|
|
{
|
2012-12-13 04:03:18 +00:00
|
|
|
return sprout::find_end(first1, last1, first2, last2, sprout::equal_to<>());
|
2012-04-01 13:15:09 +00:00
|
|
|
}
|
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIND_END_HPP
|