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. |
<metanoindex/>
<tbody> </tbody>| Definido no cabeçalho <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) | |
Trocas valor no
first posição e o valor no last-1 posição e faz com que o sub-intervalo [first, last-1) num montão'. Isto tem o efeito de remover o elemento (o maior), primeiro a partir da pilha definido pela gama [first, last).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.
A primeira versão da função utiliza
operator< comparar os elementos, o segundo usa a função de comparação dada 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.
Parâmetros
| first, last | - | a gama de elementos que definem a pilha não vazia válido para modificar
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:
The signature does not need to have |
| Type requirements | ||
-RandomIt must meet the requirements of ValueSwappable and RandomAccessIterator.
| ||
-The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.
| ||
Valor de retorno
(Nenhum)
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.
Complexidade
No máximo 2 × log (N) comparações onde
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.
Notas
Uma pilha' é uma gama de elementos
[f,l) que tem as seguintes propriedades: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é o maior elemento no intervaloOriginal:*fis 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.- um novo elemento pode ser adicionado usando
std::push_heap()Original:a new element can be added usingstd::push_heap()The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions. - o primeiro elemento pode ser removido usando
std::pop_heap()Original:the first element can be removed usingstd::pop_heap()The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
O real disposição dos elementos é definido pela implementação.
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.
Exemplo
#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 element
std::cout << "largest element: " << largest << '\n';
std::cout << "heap without largest: ";
for (auto i : v) std::cout << i << ' ';
std::cout << '\n';
}
Saída:
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
Veja também
acrescenta um elemento a um heap 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. (modelo de função) | |
