std::priority_queue::pop
Aus cppreference.com
< cpp | container | priority queue
 |
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. |
| void pop(); |
||
Removes the top element from the priority queue. Effectively calls std::pop_heap(c.begin(), c.end(), comp); c.pop_back();
Inhaltsverzeichnis |
[Bearbeiten] Parameter
(None)
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.
[Bearbeiten] Rückgabewert
(None)
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.
[Bearbeiten] Komplexität
Logarithmic number of comparisons plus the complexity of Container::pop_back.
[Bearbeiten] Siehe auch
| (C++11) |
constructs element in-place and sorts the underlying container (öffentliche Elementfunktion) |
| inserts element and sorts the underlying container (öffentliche Elementfunktion) | |
