std::sort_heap — cppreference.com

De cppreference.com

Déclaré dans l'en-tête `<algorithm>`
`template< class RandomIt > void sort_heap( RandomIt first, RandomIt last );`	(1)
`template< class RandomIt, class Compare > void sort_heap( RandomIt first, RandomIt last, Compare comp );`	(2)

Trie les éléments dans le tas [first, last) dans l'ordre croissant. La première version de la fonction utilise operator< de comparer les éléments, la seconde utilise la fonction de comparaison donnée comp .

Original:

Sorts the elements in the heap [first, last) 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.

Paramètres

first, last	-	la plage d'éléments à trier Original: the range of elements to sort 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. The types `Type1` and `Type2` must be such that an object of type `RandomIt` can be dereferenced and then implicitly converted to both of them.
Type requirements
-`RandomIt` must meet the requirements of `ValueSwappable` and `RandomAccessIterator`.
-The type of dereferenced `RandomIt` must meet the requirements of `MoveAssignable` and `MoveConstructible`.

Retourne la valeur

(Aucun)

Original:

(none)

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

Complexité

Tout au plus N × log (N) comparaisons où N=std::distance(first, last) .

Original:

At most N×log(N) comparisons where N=std::distance(first, last).

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

Notes

Un tas' est un ensemble d'éléments [f,l) qui a les propriétés suivantes:

Original:

A heap is a range of elements [f,l) that has 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.

*f est le plus grand élément de la série
Original:
*f is the largest element in the range
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
un nouvel élément peut être ajouté à l'aide std::push_heap()
Original:
a new element can be added using std::push_heap()
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
le premier élément peut être retiré à l'aide std::pop_heap()
Original:
the first element can be removed using std::pop_heap()
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

La disposition réelle des éléments est défini par l'implémentation .

Original:

The actual arrangement of the elements is implementation defined.

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

Exemple

Voir aussi


	crée un segment de mémoire sur un ensemble d'éléments Original: creates a heap out of a range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction générique) [edit]