mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
20 lines
580 B
C++
20 lines
580 B
C++
|
#ifndef SPROUT_ALGORITHM_FIND_IF_HPP
|
||
|
|
#define SPROUT_ALGORITHM_FIND_IF_HPP
|
||
|
|
|
||
|
|
#include <sprout/config.hpp>
|
||
|
|
#include <sprout/iterator/operation.hpp>
|
||
|
|
|
||
|
|
namespace sprout {
|
||
|
|
// Copyright (C) 2011 RiSK (sscrisk)
|
||
|
|
|
||
|
|
// 25.2.5 Find
|
||
|
|
template<typename InputIterator, typename Predicate>
|
||
|
|
SPROUT_CONSTEXPR InputIterator find_if(InputIterator first, InputIterator last, Predicate pred) {
|
||
|
|
return first == last || pred(*first) != false ? first
|
||
|
|
: sprout::find_if(sprout::next(first), last, pred)
|
||
|
|
;
|
||
|
|
}
|
||
|
|
} // namespace sprout
|
||
|
|
|
||
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIND_IF_HPP
|