mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
27 lines
753 B
C++
27 lines
753 B
C++
#ifndef SPROUT_ALGORITHM_IS_INCREASING_HPP
|
|
#define SPROUT_ALGORITHM_IS_INCREASING_HPP
|
|
|
|
#include <iterator>
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/algorithm/is_sorted.hpp>
|
|
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
|
|
|
|
namespace sprout {
|
|
//
|
|
// is_increasing
|
|
//
|
|
// recursion depth:
|
|
// [first, last) is RandomAccessIterator -> O(log N)
|
|
// otherwise -> O(N)
|
|
//
|
|
template<typename ForwardIterator>
|
|
inline SPROUT_CONSTEXPR bool
|
|
is_increasing(ForwardIterator first, ForwardIterator last) {
|
|
return sprout::is_sorted(
|
|
first, last,
|
|
NS_SSCRISK_CEL_OR_SPROUT::less<typename std::iterator_traits<ForwardIterator>::value_type>()
|
|
);
|
|
}
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_IS_INCREASING_HPP
|