mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
24 lines
700 B
C++
24 lines
700 B
C++
|
#ifndef SPROUT_ALGORITHM_IS_STRICTLY_DECREASING_HPP
|
||
|
|
#define SPROUT_ALGORITHM_IS_STRICTLY_DECREASING_HPP
|
||
|
|
|
||
|
|
#include <iterator>
|
||
|
|
#include <sprout/config.hpp>
|
||
|
|
#include <sprout/algorithm/is_sorted.hpp>
|
||
|
|
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
|
||
|
|
|
||
|
|
namespace sprout {
|
||
|
|
//
|
||
|
|
// is_strictly_decreasing
|
||
|
|
//
|
||
|
|
template<typename ForwardIterator>
|
||
|
|
inline SPROUT_CONSTEXPR bool
|
||
|
|
is_strictly_decreasing(ForwardIterator first, ForwardIterator last) {
|
||
|
|
return sprout::is_sorted(
|
||
|
|
first, last,
|
||
|
|
NS_SSCRISK_CEL_OR_SPROUT::greater_equal<typename std::iterator_traits<ForwardIterator>::value_type>()
|
||
|
|
);
|
||
|
|
}
|
||
|
|
} // namespace sprout
|
||
|
|
|
||
|
|
#endif // #ifndef SPROUT_ALGORITHM_IS_STRICTLY_DECREASING_HPP
|