Difference between revisions of "cpp/container/priority queue/pop"
From cppreference.com
< cpp | container | priority queue
m (Add link to edit the included template) |
m (+ shared example; ~langlinks) |
||
(2 intermediate revisions by one user not shown) | |||
Line 1: | Line 1: | ||
− | {{page | + | {{include page|cpp/container/pop|priority_queue}} |
− | + | {{langlinks|de|es|fr|it|ja|pt|ru|zh}} | |
− | + |
Latest revision as of 23:03, 30 August 2021
void pop(); |
||
Removes the top element from the priority queue. Effectively calls std::pop_heap(c.begin(), c.end(), comp); c.pop_back();.
Contents |
[edit] Parameters
(none)
[edit] Return value
(none)
[edit] Complexity
Logarithmic number of comparisons plus the complexity of Container::pop_back.
[edit] Example
Run this code
#include <iostream> #include <queue> struct Event { int priority{}; char data{' '}; friend bool operator<(Event const& lhs, Event const& rhs) { return lhs.priority < rhs.priority; } friend std::ostream& operator<<(std::ostream& os, Event const& e) { return os << '{' << e.priority << ", '" << e.data << "'}"; } }; int main() { std::priority_queue<Event> events; std::cout << "Fill the events queue:\t"; for (auto const e : {Event{6,'L'}, {8,'I'}, {9,'S'}, {1,'T'}, {5,'E'}, {3,'N'}}) { std::cout << e << ' '; events.push(e); } std::cout << "\nProcess events:\t\t"; for (; !events.empty(); events.pop()) { Event const& e = events.top(); std::cout << e << ' '; } std::cout << '\n'; }
Output:
Fill the events queue: {6, 'L'} {8, 'I'} {9, 'S'} {1, 'T'} {5, 'E'} {3, 'N'} Process events: {9, 'S'} {8, 'I'} {6, 'L'} {5, 'E'} {3, 'N'} {1, 'T'}
[edit] See also
(C++11) |
constructs element in-place and sorts the underlying container (public member function) |
inserts element and sorts the underlying container (public member function) | |
accesses the top element (public member function) |