mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-12-25 21:35:41 +00:00
36 lines
1.3 KiB
C++
36 lines
1.3 KiB
C++
#ifndef SPROUT_ALGORITHM_SEARCH_N_HPP
|
|
#define SPROUT_ALGORITHM_SEARCH_N_HPP
|
|
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/iterator/operation.hpp>
|
|
#include <sprout/iterator/value_iterator.hpp>
|
|
#include <sprout/functional/equal_to.hpp>
|
|
#include <sprout/algorithm/search.hpp>
|
|
|
|
namespace sprout {
|
|
// 25.2.13 Search
|
|
//
|
|
// recursion depth:
|
|
// [first, last) is RandomAccessIterator -> O(log N)
|
|
// otherwise -> O(N)
|
|
//
|
|
template<typename ForwardIterator, typename Size, typename T, typename BinaryPredicate>
|
|
inline SPROUT_CONSTEXPR ForwardIterator
|
|
search_n(ForwardIterator first, ForwardIterator last, Size count, T const& value, BinaryPredicate pred) {
|
|
typedef sprout::value_iterator<T const&> iterator;
|
|
typedef typename iterator::difference_type difference_type;
|
|
return sprout::search(
|
|
first, last,
|
|
iterator(value, static_cast<difference_type>(count)), iterator(value, 0),
|
|
pred
|
|
);
|
|
}
|
|
|
|
template<typename ForwardIterator, typename Size, typename T>
|
|
inline SPROUT_CONSTEXPR ForwardIterator
|
|
search_n(ForwardIterator first, ForwardIterator last, Size count, T const& value) {
|
|
return sprout::search_n(first, last, count, value, sprout::equal_to<>());
|
|
}
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_SEARCH_N_HPP
|