mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
46 lines
1.5 KiB
ReStructuredText
46 lines
1.5 KiB
ReStructuredText
.. _sprout-algorithm-find_if_not:
|
|
###############################################################################
|
|
find_if_not
|
|
###############################################################################
|
|
|
|
Interface
|
|
========================================
|
|
.. sourcecode:: c++
|
|
|
|
template<typename InputIterator, typename Predicate>
|
|
inline SPROUT_CONSTEXPR InputIterator
|
|
find_if_not(InputIterator first, InputIterator last, Predicate pred);
|
|
|
|
Returns
|
|
========================================
|
|
|
|
| The first iterator i in the range [first,last) for which the following corresponding conditions hold: ``!pred(*i)``.
|
|
| Returns last if no such iterator is found.
|
|
|
|
Examples
|
|
========================================
|
|
.. sourcecode:: c++
|
|
|
|
#include <sprout/algorithm/find_if_not.hpp>
|
|
#include <sprout/array.hpp>
|
|
#include <sprout/container.hpp>
|
|
#include <sprout/functional.hpp>
|
|
using namespace sprout;
|
|
|
|
SPROUT_STATIC_CONSTEXPR auto input = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
|
|
SPROUT_STATIC_CONSTEXPR auto result = sprout::find_if_not(begin(input), end(input), bind2nd(less<>(), 8));
|
|
static_assert(result != end(input), "found a element not less than 8 from input.");
|
|
static_assert(result - begin(input1) == 7, "a found position is 7.");
|
|
|
|
Complexity
|
|
========================================
|
|
|
|
| At most ``last - first`` applications of the predicate.
|
|
| Recursive function invocations in *O(logN)* (logarithmic) depth.
|
|
|
|
Header
|
|
========================================
|
|
|
|
| ``sprout/algorithm/find_if_not.hpp``
|
|
| Convenience header: ``sprout/algorithm.hpp``
|
|
|