mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2024-12-23 21:25:49 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

add C++14 version partition_point

Browse source
This commit is contained in:
Mitsuru Kariya 2015-02-11 23:15:08 +09:00
parent 586c9972dc
commit aba6d6b678
1 changed files with 23 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

24
sprout/algorithm/partition_point.hpp
View file

@ -13,7 +13,7 @@
#include <sprout/iterator/operation.hpp> #include <sprout/iterator/operation.hpp>
namespace sprout { namespace sprout {
#ifdef SPROUT_CONFIG_DISABLE_CXX14_CONSTEXPR
namespace detail { namespace detail {
template<typename ForwardIterator, typename Predicate> template<typename ForwardIterator, typename Predicate>
inline SPROUT_CONSTEXPR ForwardIterator inline SPROUT_CONSTEXPR ForwardIterator
@ -43,7 +43,29 @@ namespace sprout {
first, last, pred, first, last, pred,
sprout::next(first, sprout::distance(first, last) / 2) sprout::next(first, sprout::distance(first, last) / 2)
); );
#else
// 25.3.13 Partitions
//
// recursion depth:
// 0
//
template<typename ForwardIterator, typename Predicate>
inline SPROUT_CONSTEXPR ForwardIterator
partition_point(ForwardIterator first, ForwardIterator last, Predicate pred) {
typedef typename std::iterator_traits<ForwardIterator>::difference_type difference_type;
for (difference_type len = sprout::distance(first, last); len != 0; ) {
const difference_type half = len / 2;
const ForwardIterator mid = sprout::next(first, half);
if (pred(*mid)) {
first = sprout::next(mid);
len -= half + 1;
} else {
len = half;
} }
}
return first;
}
#endif
} // namespace sprout } // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_PARTITION_POINT_HPP #endif // #ifndef SPROUT_ALGORITHM_PARTITION_POINT_HPP