std::pop_heap
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. |
Déclaré dans l'en-tête <algorithm> | ||
template<class RandomIt > void pop_heap( RandomIt first, RandomIt last ); | (1) | |
template<class RandomIt, class Compare > void pop_heap( RandomIt first, RandomIt last, Compare comp ); | (2) | |
Swaps la valeur dans la position de
first et la valeur de la position et fait last-1 la sous-gamme dans un [first, last-1)' tas. Cela a pour effet de supprimer le premier (le plus grand) élément du tas défini par le [first, last) plage .Original:
Swaps the value in the position
first and the value in the position last-1 and makes the subrange [first, last-1) into a heap. This has the effect of removing the first (largest) element from the heap defined by the range [first, last).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.
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:
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.
Sommaire |
[modifier]Paramètres
| first, last | - | la gamme des éléments qui définissent le tas non vide valable à modifier Original: the range of elements defining the valid nonempty heap to modify 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 | ||
-RandomIt must meet the requirements of ValueSwappable and RandomAccessIterator. | ||
-The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible. | ||
[modifier]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.
You can help to correct and verify the translation. Click here for instructions.
[modifier]Complexité
Tout au plus 2 × log (N) comparaisons où N=std::distance(first, last) .
Original:
At most 2×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.
You can help to correct and verify the translation. Click here for instructions.
[modifier]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.
You can help to correct and verify the translation. Click here for instructions.
- *f est le plus grand élément de la sérieOriginal:*f is the largest element in the rangeThe 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.
You can help to correct and verify the translation. Click here for instructions.
[modifier]Exemple
#include <iostream>#include <algorithm> int main(){std::vector<int> v {3, 1, 4, 1, 5, 9}; std::make_heap(v.begin(), v.end()); std::cout<<"v: ";for(auto i : v)std::cout<< i <<' ';std::cout<<'\n'; std::pop_heap(v.begin(), v.end());// moves the largest to the end std::cout<<"after pop_heap: ";for(auto i : v)std::cout<< i <<' ';std::cout<<'\n'; int largest = v.back(); v.pop_back();// actually removes the largest elementstd::cout<<"largest element: "<< largest <<'\n'; std::cout<<"heap without largest: ";for(auto i : v)std::cout<< i <<' ';std::cout<<'\n';}
Résultat :
v: 9 5 4 1 1 3 after pop_heap: 5 3 4 1 1 9 largest element: 9 heap without largest: 5 3 4 1 1
[modifier]Voir aussi
ajoute un élément à un tas Original: adds an element to a heap 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) | |
