std::is_sorted
 |
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. |
| definiert in Header <algorithm>
|
||
| template< class ForwardIt > bool is_sorted( ForwardIt first, ForwardIt last ); |
(1) | (seit C++11) |
| template< class ForwardIt, class Compare > bool is_sorted( ForwardIt first, ForwardIt last, Compare comp ); |
(2) | (seit C++11) |
Checks if the elements in range [first, last) are sorted in ascending order. The first version of the function uses operator< to compare the elements, the second uses the given comparison function comp.
Inhaltsverzeichnis |
[Bearbeiten] Parameter
| first, last | - | das Spektrum der Elemente zu untersuchen
Original: the range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| 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: bool cmp(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. |
| Type requirements | ||
-ForwardIt must meet the requirements of ForwardIterator.
| ||
[Bearbeiten] Rückgabewert
true if the elements in the range are sorted in ascending order
[Bearbeiten] Komplexität
first und lastfirst and lastYou can help to correct and verify the translation. Click here for instructions.
[Bearbeiten] Mögliche Implementierung
| First version |
|---|
template<class ForwardIt> bool is_sorted(ForwardIt first, ForwardIt last) { return std::is_sorted_until(first, last) == last; } |
| Second version |
template<class ForwardIt, class Compare> bool is_sorted(ForwardIt first, ForwardIt last, Compare comp) { return std::is_sorted_until(first, last, comp) == last; } |
[Bearbeiten] Beispiel
#include <iostream> #include <algorithm> int main() { const int N = 5; int digits[N] = {3, 1, 4, 1, 5}; for (auto i : digits) std::cout << i << ' '; std::cout << ": is_sorted: " << std::is_sorted(digits, digits+N) << '\n'; std::sort(digits, digits+N); for (auto i : digits) std::cout << i << ' '; std::cout << ": is_sorted: " << std::is_sorted(digits, digits+N) << '\n'; }
Output:
3 1 4 1 5 : is_sorted: 0 1 1 3 4 5 : is_sorted: 1
[Bearbeiten] Siehe auch
| (C++11) |
findet die größte sortiert Teilbereich Original: finds the largest sorted subrange The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (Funktions-Template) |
