mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
61 lines
1.7 KiB
C++
61 lines
1.7 KiB
C++
#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>
|
|
|
|
namespace sprout {
|
|
// Copyright (C) 2011 RiSK (sscrisk)
|
|
|
|
namespace detail {
|
|
template<typename Iterator1, typename Iterator2>
|
|
struct iter_equal_to {
|
|
public:
|
|
SPROUT_CONSTEXPR bool operator()(
|
|
typename std::iterator_traits<Iterator1>::value_type const& x,
|
|
typename std::iterator_traits<Iterator2>::value_type const& y
|
|
) const
|
|
{
|
|
return x == y;
|
|
}
|
|
};
|
|
} // namespace detail
|
|
|
|
// 25.2.6 Find end
|
|
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate>
|
|
inline SPROUT_CONSTEXPR ForwardIterator1 find_end(
|
|
ForwardIterator1 first1,
|
|
ForwardIterator1 last1,
|
|
ForwardIterator2 first2,
|
|
ForwardIterator2 last2,
|
|
BinaryPredicate pred
|
|
)
|
|
{
|
|
return first1 == last1 || first2 == last2 ? last1
|
|
: sprout::search(first1, last1, first2, last2, pred) == first1
|
|
&& sprout::search(sprout::next(first1), last1, first2, last2, pred) == last1
|
|
? first1
|
|
: sprout::find_end(sprout::next(first1), last1, first2, last2, pred)
|
|
;
|
|
}
|
|
|
|
template<typename ForwardIterator1, typename ForwardIterator2>
|
|
inline SPROUT_CONSTEXPR ForwardIterator1 find_end(
|
|
ForwardIterator1 first1,
|
|
ForwardIterator1 last1,
|
|
ForwardIterator2 first2,
|
|
ForwardIterator2 last2
|
|
)
|
|
{
|
|
return sprout::find_end(
|
|
first1,
|
|
last1,
|
|
first2,
|
|
last2,
|
|
sprout::detail::iter_equal_to<ForwardIterator1, ForwardIterator2>()
|
|
);
|
|
}
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIND_END_HPP
|