stdadjacent_find(3)
std::adjacent_find - std::adjacent_find
Synopsis
Defined in header <algorithm>
template< class ForwardIt > (until C++20)
ForwardIt adjacent_find( ForwardIt first, ForwardIt last );
template< class ForwardIt > (since C++20)
constexpr ForwardIt adjacent_find( ForwardIt first, ForwardIt last );
template< class ExecutionPolicy, class ForwardIt >
ForwardIt adjacent_find( ExecutionPolicy&& policy, (2) (since C++17)
ForwardIt first, ForwardIt last ); (1)
template< class ForwardIt, class BinaryPredicate> (until C++20)
ForwardIt adjacent_find( ForwardIt first, ForwardIt last, BinaryPredicate p );
template< class ForwardIt, class BinaryPredicate> (since C++20)
constexpr ForwardIt adjacent_find( ForwardIt first, ForwardIt last, BinaryPredicate p ); (3)
template< class ExecutionPolicy, class ForwardIt, class BinaryPredicate>
ForwardIt adjacent_find( ExecutionPolicy&& policy, (4) (since C++17)
ForwardIt first, ForwardIt last, BinaryPredicate p );Searches the range [first, last) for two consecutive identical elements.
- Elements are compared using operator==.
- Elements are compared using the given binary predicate p. 2,4) Same as (1,3), but executed according to policy. These overloads do not participate in overload resolution unless std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true
Parameters
first, last - the range of elements to examine
policy - the execution policy to use. See execution_policy for details.
Type requirements
ForwardIt must meet the requirements of LegacyForwardIterator.
Return value
an iterator to the first of the first pair of identical elements, that is, the first iterator it such that *it == *(it+1) for the first version or p(*it, *(it + 1)) != false for the second version. If no such elements are found, last is returned
Complexity
1,3) Exactly min((result-first)+1, (last-first)-1) applications of the predicate where result is the return value. 2,4) O(last-first) applications of the corresponding predicate.
Exceptions
The overloads with a template parameter named ExecutionPolicy report errors as follows:
- If execution of a function invoked as part of the algorithm throws an exception and ExecutionPolicy is one of the standard_policies, std::terminate is called. For any other ExecutionPolicy, the behavior is implementation-defined.
- If the algorithm fails to allocate memory, std::bad_alloc is thrown.
Possible implementation
First version
Second version
Example
// Run this code
#include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
int main()
{
std::vector<int> v1{0, 1, 2, 3, 40, 40, 41, 41, 5};
auto i1 = std::adjacent_find(v1.begin(), v1.end());
if (i1 == v1.end()) {
std::cout << "no matching adjacent elements\n";
} else {
std::cout << "the first adjacent pair of equal elements at: "
<< std::distance(v1.begin(), i1) << ‘\n’;
}
auto i2 = std::adjacent_find(v1.begin(), v1.end(), std::greater<int>());
if (i2 == v1.end()) {
std::cout << "The entire vector is sorted in ascending order\n";
} else {
std::cout << "The last element in the non-decreasing subsequence is at: "
<< std::distance(v1.begin(), i2) << ‘\n’;
}
}
Output:
See also