Espaces de noms
Variantes
    Actions

      std::mismatch

      De cppreference.com
      < cpp‎ | algorithm

      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.

      Click here for the English version of this page

       
      C++
       
      Bibliothèque d'algorithmes
      Fonctions
      Original:
      Functions
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Non-modification de la séquence des opérations
      Original:
      Non-modifying sequence operations
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      all_of
      any_of
      none_of      		 (C++11)
      (C++11)
      (C++11)
      for_each
      count
      count_if
      mismatch
      equal
      Modification de la séquence des opérations
      Original:
      Modifying sequence operations
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Des opérations de partitionnement
      Original:
      Partitioning operations
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Opérations de tri (sur les gammes triés)
      Original:
      Sorting operations (on sorted ranges)
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Opérations binaires de recherche (sur les gammes triés)
      Original:
      Binary search operations (on sorted ranges)
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Définir les opérations (sur les gammes triés)
      Original:
      Set operations (on sorted ranges)
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Opérations Heap
      Original:
      Heap operations
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Minimum / maximum de fonctionnement
      Original:
      Minimum/maximum operations
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Opérations numériques
      Original:
      Numeric operations
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      Bibliothèque C
      Original:
      C library
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
       
      Déclaré dans l'en-tête <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 désadaptation d'abord des éléments de deux gammes: celle définie par [first1, last1) et un autre à partir de first2. La première version de la fonction utilise operator== de comparer les éléments, la deuxième version utilise le prédicat 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.

      Sommaire

      [modifier]Paramètres

      first1, last1 -
      la première plage des éléments
      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 début de la seconde plage des éléments
      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:

       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.
      The types  Type1 and  Type2 must be such that objects of types InputIt1 and InputIt2 can be dereferenced and then implicitly converted to  Type1 and  Type2 respectively.

      ​

      Type requirements
      -
      InputIt1 must meet the requirements of InputIterator.
      -
      InputIt2 must meet the requirements of InputIterator.
      -
      OutputIt must meet the requirements of OutputIterator.

      [modifier]Retourne la valeur

      std::pair avec les itérateurs aux deux premières non équivalents éléments, ou, si aucun des différents éléments trouvés, paire avec last1 et l'itérateur correspondant de la deuxième 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.

      [modifier]Complexité

      Tout au plus last1 - first1 applications du prédicat
      Original:
      At most last1 - first1 applications of the predicate
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      [modifier]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;}returnstd::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;}returnstd::make_pair(first1, first2);}

      [modifier]Exemple

      Ce programme détermine la sous-chaîne la plus longue qui est simultanément trouve au tout début de la chaîne 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.

      #include <iostream>#include <string>#include <algorithm>   std::string mirror_ends(conststd::string& in){returnstd::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';}

      Résultat : 

      ab a aba

      [modifier]Voir aussi

      détermine si deux ensembles d'éléments sont les mêmes
      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 générique)[edit]


      (C++11)
      trouve le premier élément répondant à des critères spécifiques
      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 générique)[edit]
      renvoie vrai si une plage est lexicographiquement inférieur à 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 générique)[edit]
      recherches pour une série d'éléments
      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 générique)[edit]
      Récupérée de « https://fr.cppreference.com/mwiki/index.php?title=cpp/algorithm/mismatch&oldid=47528 »
      close