std::is_sorted_until
De cppreference.com
 [] |
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. |
![[]](https://upload.cppreference.com/mwiki/images/3/31/Imbox_notice.png){kind=link}
<metanoindex/>
<tbody> </tbody>| Dclar dans l'en-tte <algorithm>
|
||
template< class ForwardIt > ForwardIt is_sorted_until( ForwardIt first, ForwardIt last ); |
(1) | (depuis C++11) |
template< class ForwardIt, class Compare > ForwardIt is_sorted_until( ForwardIt first, ForwardIt last, Compare comp ); |
(2) | (depuis C++11) |
Examine la porte et
[first, last) trouve le plus grand nombre au dbut first dans lequel les lments sont tris dans l'ordre croissant. La premire version de la fonction utilise operator< de comparer les lments, la seconde utilise la fonction de comparaison donne comp .Original:
Examines the range
[first, last) and finds the largest range beginning at first in which the elements 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.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Paramtres
| first, last | - | l'ventail des lments examiner
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:
The signature does not need to have |
| Type requirements | ||
-ForwardIt must meet the requirements of ForwardIterator.
| ||
Retourne la valeur
La limite suprieure de la gamme la plus tendue au dbut
first dans lequel les lments sont tris dans l'ordre croissant. Autrement dit, le it itrateur plus rcente pour laquelle [first, it) plage est trie .Original:
The upper bound of the largest range beginning at
first in which the elements are sorted in ascending order. That is, the last iterator it for which range [first, it) is sorted.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Complexit
linaire de la distance entre
first et lastOriginal:
linear in the distance between
first and lastThe text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Mise en uvre possible
| First version |
|---|
template<class ForwardIt>
ForwardIt is_sorted_until(ForwardIt first, ForwardIt last)
{
if (first != last) {
ForwardIt next = first;
while (++next != last) {
if (*next < *first)
return next;
first = next;
}
}
return last;
}
|
| Second version |
template< class ForwardIt, class Compare >
ForwardIt is_sorted_until(ForwardIt first, ForwardIt last,
Compare comp)
{
if (first != last) {
ForwardIt next = first;
while (++next != last) {
if (comp(*next, *first))
return next;
first = next;
}
}
return last;
|
Exemple
#include <iostream>
#include <algorithm>
#include <iterator>
#include <random>
int main()
{
std::random_device rd;
std::mt19937 g(rd());
const int N = 6;
int nums[N] = {3, 1, 4, 1, 5, 9};
const int min_sorted_size = 4;
int sorted_size = 0;
do {
std::random_shuffle(nums, nums + N, g);
int *sorted_end = std::is_sorted_until(nums, nums + N);
sorted_size = std::distance(nums, sorted_end);
for (auto i : nums) std::cout << i << ' ';
std::cout << " : " << sorted_size << " initial sorted elements\n";
} while (sorted_size < min_sorted_size);
}
Rsultat possible :
4 1 9 5 1 3 : 1 initial sorted elements
4 5 9 3 1 1 : 3 initial sorted elements
9 3 1 4 5 1 : 1 initial sorted elements
1 3 5 4 1 9 : 3 initial sorted elements
5 9 1 1 3 4 : 2 initial sorted elements
4 9 1 5 1 3 : 2 initial sorted elements
1 1 4 9 5 3 : 4 initial sorted elements
Voir aussi
(C++11) |
vrifie si une plage est trie dans l'ordre croissant Original: checks whether a range is sorted into ascending order The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) |