King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Code Issues Releases Wiki Activity

[algorithm.binary_search] Use comp parameter for lower_bound.

Browse source
This commit is contained in:
Mitsuru Kariya 2013-09-02 22:47:15 +09:00
parent 5686785ea9
commit 37bcbe7917
1 changed files with 3 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
sprout/algorithm/binary_search.hpp
View file

@ -11,7 +11,7 @@
#include <iterator>
#include <sprout/config.hpp>
#include <sprout/algorithm/lower_bound.hpp>
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
#include <sprout/functional/less.hpp>
namespace sprout {
namespace detail {
@ -30,16 +30,13 @@ namespace sprout {
template<typename ForwardIterator, typename T, typename Compare>
inline SPROUT_CONSTEXPR bool
binary_search(ForwardIterator first, ForwardIterator last, T const& value, Compare comp) {
return sprout::detail::binary_search_impl(sprout::lower_bound(first, last, value), last, value, comp);
return sprout::detail::binary_search_impl(sprout::lower_bound(first, last, value, comp), last, value, comp);
}
template<typename ForwardIterator, typename T>
inline SPROUT_CONSTEXPR bool
binary_search(ForwardIterator first, ForwardIterator last, T const& value) {
return sprout::binary_search(
first, last, value,
NS_SSCRISK_CEL_OR_SPROUT::less<typename std::iterator_traits<ForwardIterator>::value_type>()
);
return sprout::binary_search(first, last, value, sprout::less<>());
}
} // namespace sprout