std::adjacent_find
De cppreference.com
 | This page has been machine-translated from the English version of the wiki using Google Translate. The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
Déclaré dans l'en-tête <algorithm> | ||
template<class ForwardIt > ForwardIt adjacent_find( ForwardIt first, ForwardIt last ); | (1) | |
template<class ForwardIt, BinaryPredicate p > ForwardIt adjacent_find( ForwardIt first, ForwardIt last, BinaryPredicate p ); | (2) | |
Recherche dans le
[first, last) plage pour deux éléments consécutifs identiques. La première version utilise operator== de comparer les éléments, la deuxième version utilise le prédicat binaire donné p . Original:
Searches the range
[first, last) for two consecutive identical elements. The first version uses operator== to compare the elements, the second version uses the given binary predicate p. The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Sommaire |
[modifier]Paramètres
| first, last | - | l'éventail des éléments à examiner Original: the range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| p | - | binary predicate which returns true if the elements should be treated as equal. The signature of the predicate function should be equivalent to the following: bool pred(const Type1 &a, const Type2 &b); The signature does not need to have const&, but the function must not modify the objects passed to it. |
| Type requirements | ||
-ForwardIt must meet the requirements of ForwardIterator. | ||
[modifier]Retourne la valeur
un itérateur pour le premier des éléments identiques. Si aucun de ces éléments sont trouvés,
last est retournéOriginal:
an iterator to the first of the identical elements. If no such elements are found,
last is returnedThe text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[modifier]Complexité
Exactement les petites applications de
(result - first) et ((last - 1) - first) du prédicat result où est la valeur de retour .Original:
Exactly the smaller of
(result - first) and ((last - 1) - first) applications of the predicate where result is the return value.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[modifier]Mise en œuvre possible
| First version |
|---|
template<class ForwardIt> ForwardIt adjacent_find(ForwardIt first, ForwardIt last){if(first == last){return last;} ForwardIt next = first;++next;for(next != last;++next, ++first){if(*first ==*next){return first;}}return last;} |
| Second version |
template<class ForwardIt, BinaryPredicate p> ForwardIt adjacent_find(ForwardIt first, ForwardIt last, BinaryPredicate p){if(first == last){return last;} ForwardIt next = first;++next;for(next != last;++next, ++first){if(p(*first, *next)){return first;}}return last;} |
[modifier]Exemple
Le code suivant recherche une paire d'entiers équivalentes dans un tableau de intergers .
Original:
The following code finds a pair of equivalent integers in an array of intergers.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
#include <algorithm>#include <iostream> int main(){std::vector<int> v1{0, 1, 2, 3, 40, 40, 5}; std::vector<int>::iterator result; result = std::adjacent_find(v1.begin(), v1.end()); if(result == v1.end()){std::cout<<"no matching adjacent elements";}else{std::cout<<"match at: "<<std::distance(v1.begin(), result);}}
Résultat :
match at: 4
[modifier]Voir aussi
supprime les doublons successifs dans une plage Original: removes consecutive duplicate elements in a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction générique) | |
