std::lexicographical_compare – cppreference.com
Aus cppreference.com
<metanoindex/>
<tbody> </tbody>
| definiert in Header <algorithm> |
||
|
|
(1) | |
|
|
(2) | |
Prüft, ob der erste Bereich [first1, last1) lexikographisch weniger als der zweite Bereich [first2, last2). Die erste Version verwendet operator< um die Elemente zu vergleichen, verwendet die zweite Version des gegebenen Vergleichsfunktion comp .
Original:
Checks if the first range [first1, last1) is lexicographically less than the second range [first2, last2). The first version uses operator< to compare the elements, the second version uses the given comparison function comp.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Lexikographischen Vergleich ist ein Betrieb mit den folgenden Eigenschaften:
Original:
Lexicographical comparison is a operation with the following properties:
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Zwei Bereiche sind elementweise verglichen .
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.Die erste Fehlanpassung Element definiert, welcher Bereich ist lexikographisch weniger oder mehr als der andere .
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.Wenn ein Bereich ist ein Präfix eines anderen, ist die kürzere Reichweite lexikographisch weniger als der andere .
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.Wenn zwei Bereiche äquivalente Elemente aufweisen und die gleiche Länge, so sind die Bereiche liegen lexikographisch' gleich .
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.Ein leerer Bereich ist lexikographisch weniger als jeder nicht-leeren Bereich .
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.Zwei leere Bereiche sind lexikographisch gleich .
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.
Parameter
| first1, last1 | - | die erste Reihe von Elementen zu prüfen Original: the first range of elements to examine The text has been machine-translated via Google Translate. |
| first2, last2 | - | der zweite Bereich von Elementen zu prüfen Original: the second range of elements to examine The text has been machine-translated via Google Translate. |
| comp | - | comparison function which returns true if the first argument is less than the second.
The signature of the comparison function should be equivalent to the following:
The signature does not need to have |
| Type requirements | ||
-InputIt1, InputIt2 must meet the requirements of InputIterator.
| ||
Rückgabewert
true wenn der erste Bereich ist lexikographisch' weniger als der zweite .
Original:
true if the first range is lexicographically less than the second.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Komplexität
Höchstens 2·min(N1, N2) Anwendungen des Vergleichs-Operation, wobei N1 = std::distance(first1, last1) und N2 = std::distance(first2, last2) .
Original:
At most 2·min(N1, N2) applications of the comparison operation, where N1 = std::distance(first1, last1) and N2 = std::distance(first2, last2).
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Mögliche Implementierung
| First version |
|---|
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); } |
| Second version |
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); } |
Beispiel
#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'; }
Possible output:
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