◐ Shell
clean mode source ↗

std::mismatch - cppreference.com

Da cppreference.com.

Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate.

La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui.

Click here for the English version of this page

<metanoindex/>

<tbody> </tbody>

Elemento definito nell'header

<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)

Restituisce la prima coppia di elementi di mismatching da due gruppi: quello definito dalla [first1, last1) e un altro a partire da first2. La prima versione della funzione utilizza operator== per confrontare gli elementi, la seconda versione utilizza il predicato binario dato 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.

Parametri

first1, last1 -

la prima serie di elementi

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 -

all'inizio del secondo intervallo di elementi

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.

Valore di ritorno

std::pair con iteratori alle prime due non equivalenti elementi, o, in mancanza di elementi diversi trovato, coppia con last1 e l'iteratore corrispondente dal secondo intervallo.

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.

Complessità

Al massimo last1 - first1 applicazioni del predicato

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.

Possibile implementazione

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);
}

Esempio

Questo programma determina la più lunga sottostringa che si trova contemporaneamente all'inizio della stringa specifico e alla fine di esso, in ordine inverso (possibilmente sovrapposti)

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(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';
}

Output:

Vedi anche

determina se due serie di elementi sono gli stessi

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.


(funzione di modello) [modifica]

trova il primo elemento che soddisfi i criteri specifici

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.


(funzione di modello) [modifica]

restituisce true se un intervallo è lessicograficamente minore di un altro

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.


(funzione di modello) [modifica]
searches for a range of elements
(funzione di modello) [modifica]