std::mismatch
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. |
![[]](https://upload.cppreference.com/mwiki/images/3/31/Imbox_notice.png){kind=link}
<metanoindex/>
<tbody> </tbody>| Dclar dans l'en-tte <algorithm>
|
||
template< class InputIt1, class InputIt2 > std::pair<InputIt1,InputIt2> mismatch( InputIt1 first1, InputIt1 last1, InputIt2 first2 ); |
(1) | |
template< class InputIt1, class InputIt2, class BinaryPredicate > std::pair<InputIt1,InputIt2> mismatch( InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p ); |
(2) | |
Retourne la paire dsadaptation d'abord des lments de deux gammes: celle dfinie par
[first1, last1) et un autre partir de first2. La premire version de la fonction utilise operator== de comparer les lments, la deuxime version utilise le prdicat binaire donn p . Original:
Returns the first mismatching pair of elements from two ranges: one defined by
[first1, last1) and another starting at first2. The first version of the function 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.
Paramtres
| first1, last1 | - | la premire plage des lments
Original: the first range of the elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| first2 | - | le dbut de la seconde plage des lments
Original: the beginning of the second range of the elements 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:
The signature does not need to have
|
| Type requirements | ||
-InputIt1 must meet the requirements of InputIterator.
| ||
-InputIt2 must meet the requirements of InputIterator.
| ||
-OutputIt must meet the requirements of OutputIterator.
| ||
Retourne la valeur
std::pair avec les itrateurs aux deux premires non quivalents lments, ou, si aucun des diffrents lments trouvs, paire avec
last1 et l'itrateur correspondant de la deuxime plage .Original:
std::pair with iterators to the first two non-equivalent elements, or, if no different elements found, pair with
last1 and the corresponding iterator from the second range.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.
Complexit
Tout au plus
last1 - first1 applications du prdicatOriginal:
At most
last1 - first1 applications of the predicateThe 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.
Mise en uvre possible
| First version |
|---|
template<class InputIt1, class InputIt2>
std::pair<InputIt1, InputIt2>
mismatch(InputIt1 first1, InputIt1 last1, InputIt2 first2)
{
while (first1 != last1 && *first1 == *first2) {
++first1, ++first2;
}
return std::make_pair(first1, first2);
}
|
| Second version |
template<class InputIt1, class InputIt2, class BinaryPredicate>
std::pair<InputIt1, InputIt2>
mismatch(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p)
{
while (first1 != last1 && p(*first1, *first2)) {
++first1, ++first2;
}
return std::make_pair(first1, first2);
}
|
Exemple
Ce programme dtermine la sous-chane la plus longue qui est simultanment trouve au tout dbut de la chane et la fin de celui-ci, dans l'ordre inverse (qui peuvent se chevaucher)
Original:
This program determines the the longest substring that is simultaneously found at the very beginning of the given string and at the very end of it, in reverse order (possibly overlapping)
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 <iostream>
#include <string>
#include <algorithm>
std::string mirror_ends(const std::string& in)
{
return std::string(in.begin(),
std::mismatch(in.begin(), in.end(), in.rbegin()).first);
}
int main()
{
std::cout << mirror_ends("abXYZba") << '\n'
<< mirror_ends("abca") << '\n'
<< mirror_ends("aba") << '\n';
}
Rsultat :
ab
a
aba
Voir aussi
dtermine si deux ensembles d'lments sont les mmes Original: determines if two sets of elements are the same The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |
(C++11) |
trouve le premier lment rpondant des critres spcifiques Original: finds the first element satisfying specific criteria The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) |
renvoie vrai si une plage est lexicographiquement infrieur un autre Original: returns true if one range is lexicographically less than another The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |
recherches pour une srie d'lments Original: searches for a range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |