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.upper_bound] Change a bit.

Browse source
This commit is contained in:
Mitsuru Kariya 2013-08-31 01:08:37 +09:00
parent 3acc1ac301
commit 9704d9e777
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
sprout/algorithm/upper_bound.hpp
View file

@ -27,7 +27,7 @@ namespace sprout {
return first == last ? last return first == last ? last
: sprout::next(first) == last ? !comp(value, *first) ? last : first : sprout::next(first) == last ? !comp(value, *first) ? last : first
: !comp(value, *sprout::next(first, sprout::distance(first, last) / 2)) : !comp(value, *sprout::next(first, sprout::distance(first, last) / 2))
? sprout::upper_bound(sprout::next(first, sprout::distance(first, last) / 2), last, value, comp) ? sprout::upper_bound(sprout::next(first, sprout::distance(first, last) / 2 + 1), last, value, comp)
: sprout::upper_bound(first, sprout::next(first, sprout::distance(first, last) / 2), value, comp) : sprout::upper_bound(first, sprout::next(first, sprout::distance(first, last) / 2), value, comp)
; ;
} }
@ -37,7 +37,7 @@ namespace sprout {
upper_bound(ForwardIterator first, ForwardIterator last, T const& value) { upper_bound(ForwardIterator first, ForwardIterator last, T const& value) {
return sprout::upper_bound( return sprout::upper_bound(
first, last, value, first, last, value,
NS_SSCRISK_CEL_OR_SPROUT::less<typename std::iterator_traits<ForwardIterator>::value_type>() NS_SSCRISK_CEL_OR_SPROUT::less<>()
); );
} }
} // namespace sprout } // namespace sprout