mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2025-08-03 12:49:50 +00:00
fix recursion depth: some algorithms
This commit is contained in:
parent
bb59363682
commit
e2b207d3be
34 changed files with 796 additions and 87 deletions
|
@ -98,7 +98,7 @@ namespace sprout {
|
|||
// search_one
|
||||
//
|
||||
// recursion depth:
|
||||
// O(log (N1+N2))
|
||||
// O(log(N1+N2))
|
||||
//
|
||||
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate>
|
||||
inline SPROUT_CONSTEXPR ForwardIterator1
|
||||
|
@ -111,7 +111,7 @@ namespace sprout {
|
|||
search_one(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2) {
|
||||
return sprout::detail::search_one(first1, last1, first2, last2, sprout::equal_to<>());
|
||||
}
|
||||
} //namespace detail
|
||||
} // namespace detail
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_DETAIL_ALGORITHM_SEARCH_ONE_HPP
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue