std::lexicographical_compare

[]

Esta pgina se ha traducido por ordenador/computador/computadora de la versin en ingls de la Wiki usando Google Translate. La traduccin puede contener errores y palabras aparatosas/incorrectas. Planea sobre el texto para ver la versin original. Puedes ayudar a corregir los errores y mejorar la traduccin. Para instrucciones haz clic aqu.

template< class InputIt1, class InputIt2 >
bool lexicographical_compare( InputIt1 first1, InputIt1 last1,
                              InputIt2 first2, InputIt2 last2 );

template< class InputIt1, class InputIt2, class Compare >
bool lexicographical_compare( InputIt1 first1, InputIt1 last1,
                              InputIt2 first2, InputIt2 last2,
                              Compare comp );

• Dos cadenas se comparan elemento por elemento .

  Original:

  Two ranges are compared element by element.

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.
• El elemento descalce primera define qu rango es menos lexicogrfico''' o mayor que el otro .

  Original:

  The first mismatching element defines which range is lexicographically less or greater than the other.

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.
• Si una serie es un prefijo de otro, el rango ms corto es lexicogrfico' menos que el otro .

  Original:

  If one range is a prefix of another, the shorter range is lexicographically less than the other.

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.
• Si dos gamas tienen elementos equivalentes y son de la misma longitud, entonces los rangos son iguales lexicogrficamente' .

  Original:

  If two ranges have equivalent elements and are of the same length, then the ranges are lexicographically equal.

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.
• Un rango de vaco es lexicogrfico' menos de cualquier rango que no est vaca .

  Original:

  An empty range is lexicographically less than any non-empty range.

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.
• Dos cadenas vacas son lexicogrfico' igual .

  Original:

  Two empty ranges are lexicographically equal.

  The text has been machine-translated via Google Translate.
  You can help to correct and verify the translation. Click here for instructions.

Parmetros

Valor de retorno

Complejidad

Posible implementacin

template<class InputIt1, class InputIt2>
bool lexicographical_compare(InputIt1 first1, InputIt1 last1,
                             InputIt2 first2, InputIt2 last2)
{
    for ( ; (first1 != last1) && (first2 != last2); first1++, first2++ ) {
        if (*first1 < *first2) return true;
        if (*first2 < *first1) return false;
    }
    return (first1 == last1) && (first2 != last2);
}

template<class InputIt1, class InputIt2, class Compare>
bool lexicographical_compare(InputIt1 first1, InputIt1 last1,
                             InputIt2 first2, InputIt2 last2,
                             Compare comp)
{
    for ( ; (first1 != last1) && (first2 != last2); first1++, first2++ ) {
        if (comp(*first1, *first2)) return true;
        if (comp(*first2, *first1)) return false;
    }
    return (first1 == last1) && (first2 != last2);
}

Ejemplo

#include <algorithm>
#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>

int main()
{
    std::vector<char> v1 {'a', 'b', 'c', 'd'};
    std::vector<char> v2 {'a', 'b', 'c', 'd'};

    std::srand(std::time(0));
    while (!std::lexicographical_compare(v1.begin(), v1.end(),
                                         v2.begin(), v2.end())) {
        for (auto c : v1) std::cout << c << ' ';
        std::cout << ">= ";
        for (auto c : v2) std::cout << c << ' ';
        std::cout << '\n';

        std::random_shuffle(v1.begin(), v1.end());
        std::random_shuffle(v2.begin(), v2.end());
    }

    for (auto c : v1) std::cout << c << ' ';
    std::cout << "< ";
    for (auto c : v2) std::cout << c << ' ';
    std::cout << '\n';
}

a b c d >= a b c d 
d a b c >= c b d a 
b d a c >= a d c b 
a c d b < c d a b