King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2025-08-03 12:49:50 +00:00
Code Issues Releases Wiki Activity

Change find_end:

Browse source 
1.Fix for ForwardIterator when [first2, last2) is empty.
2.Fix RandomAccessIterator version.(search from last1)
3.Add BidirectionalIterator version.(search from last1)
4.Add sprout::detail::search_one_rev helper function for
  BidirectionalIterator version.
This commit is contained in:
Mitsuru Kariya 2013-08-28 08:34:20 +09:00
parent f194a7f68c
commit bfc22a86a7
2 changed files with 250 additions and 67 deletions
Download patch file Download diff file Expand all files Collapse all files

109
sprout/detail/algorithm/search_one_rev.hpp Normal file
View file

@ -0,0 +1,109 @@
/*=============================================================================
Copyright (c) 2011-2013 Bolero MURAKAMI
https://github.com/bolero-MURAKAMI/Sprout
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
#ifndef SPROUT_DETAIL_ALGORITHM_SEARCH_ONE_REV_HPP
#define SPROUT_DETAIL_ALGORITHM_SEARCH_ONE_REV_HPP
#include <iterator>
#include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/functional/equal_to.hpp>
#include <sprout/tuple/tuple/tuple.hpp>
#include <sprout/tuple/tuple/get.hpp>
#include <sprout/utility/pair/pair.hpp>
namespace sprout {
namespace detail {
template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR sprout::tuples::tuple<BidirectionalIterator1, BidirectionalIterator2, bool>
search_one_rev_impl_1(
sprout::tuples::tuple<BidirectionalIterator1, BidirectionalIterator2, bool> const& current,
BidirectionalIterator1 first1, BidirectionalIterator2 first2, BinaryPredicate pred,
typename std::iterator_traits<BidirectionalIterator1>::difference_type n
)
{
typedef sprout::tuples::tuple<BidirectionalIterator1, BidirectionalIterator2, bool> type;
return sprout::tuples::get<2>(current) ? current
: sprout::tuples::get<1>(current) == first2 ? type(sprout::tuples::get<0>(current), first2, true)
: sprout::tuples::get<0>(current) == first1 ? type(first1, sprout::tuples::get<1>(current), true)
: n == 1 ? pred(*sprout::prev(sprout::tuples::get<0>(current)), *sprout::prev(sprout::tuples::get<1>(current)))
? type(sprout::prev(sprout::tuples::get<0>(current)), sprout::prev(sprout::tuples::get<1>(current)), false)
: type(sprout::tuples::get<0>(current), sprout::tuples::get<1>(current), true)
: sprout::detail::search_one_rev_impl_1(
sprout::detail::search_one_rev_impl_1(
current,
first1, first2, pred, n / 2
),
first1, first2, pred, n - n / 2
)
;
}
template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR sprout::tuples::tuple<BidirectionalIterator1, BidirectionalIterator2, bool>
search_one_rev_impl(
sprout::tuples::tuple<BidirectionalIterator1, BidirectionalIterator2, bool> const& current,
BidirectionalIterator1 first1, BidirectionalIterator2 first2, BinaryPredicate pred,
typename std::iterator_traits<BidirectionalIterator1>::difference_type n
)
{
typedef sprout::tuples::tuple<BidirectionalIterator1, BidirectionalIterator2, bool> type;
return sprout::tuples::get<2>(current) ? current
: sprout::tuples::get<1>(current) == first2 ? type(sprout::tuples::get<0>(current), first2, true)
: sprout::tuples::get<0>(current) == first1 ? type(first1, sprout::tuples::get<1>(current), true)
: sprout::detail::search_one_rev_impl(
sprout::detail::search_one_rev_impl_1(
current,
first1, first2, pred, n
),
first1, first2, pred, n * 2
)
;
}
template<typename BidirectionalIterator1, typename BidirectionalIterator2>
inline SPROUT_CONSTEXPR sprout::pair<BidirectionalIterator1, bool>
search_one_rev_check(
sprout::tuples::tuple<BidirectionalIterator1, BidirectionalIterator2, bool> const& result,
BidirectionalIterator1 first1, BidirectionalIterator1 last1, BidirectionalIterator2 first2
)
{
typedef sprout::pair<BidirectionalIterator1, bool> type;
return sprout::tuples::get<1>(result) == first2 ? type(sprout::tuples::get<0>(result), false)
: type(last1, sprout::tuples::get<0>(result) == first1)
;
}
//
// search_one_rev
//
// recursion depth:
// O(log(N1+N2))
//
template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR sprout::pair<BidirectionalIterator1, bool>
search_one_rev(
BidirectionalIterator1 first1, BidirectionalIterator1 last1,
BidirectionalIterator2 first2, BidirectionalIterator2 last2, BinaryPredicate pred
)
{
typedef sprout::tuples::tuple<BidirectionalIterator1, BidirectionalIterator2, bool> type;
return sprout::detail::search_one_rev_check(
sprout::detail::search_one_rev_impl(type(last1, last2, false), first1, first2, pred, 1),
first1, last1, first2);
}
template<typename BidirectionalIterator1, typename BidirectionalIterator2>
inline SPROUT_CONSTEXPR sprout::pair<BidirectionalIterator1, bool>
search_one_rev(
BidirectionalIterator1 first1, BidirectionalIterator1 last1,
BidirectionalIterator2 first2, BidirectionalIterator2 last2
)
{
return sprout::detail::search_one(first1, last1, first2, last2, sprout::equal_to<>());
}
} // namespace detail
} // namespace sprout
#endif // #ifndef SPROUT_DETAIL_ALGORITHM_SEARCH_ONE_REV_HPP