std::partition_point
From Cppreference
Defined in header <algorithm>
|
||
template< class ForwardIterator, class UnaryPredicate >
ForwardIterator partition_point( ForwardIterator first, ForwardIterator last, |
(1) | (C++11 feature) |
Examines the partitioned (as if by std::partition) range [first, last) and locates the end of the first partition, that is, the first element that does not satisfy p or last if last if all elements satisfy p.
Contents |
[edit] Parameters
first, last | - | the partitioned range of elements to examine | |||||||||
p | - | unary predicate which returns true for the elements found in the beginning of the range. The signature of the predicate function should be equivalent to the following:
The signature does not need to have const &, but the function must not modify the objects passed to it. |
[edit] Return value
The iterator past the end of the first partition within [first, last) or last if all elements satisfy p.
[edit] Complexity
Logarithmic in the distance between first and last
[edit] Example
This section is incomplete |
[edit] See also
|
checks whether a range is sorted into ascending order (function template) |