命名空间
变体
操作

std::priority_queue<T,Container,Compare>::pop

来自 cppreference.cn

[编辑 模板]
 
C++
 
容器库
 
std::priority_queue
 
void pop();

从优先级队列中移除顶部元素。 有效地调用 std::pop_heap(c.begin(), c.end(), comp); c.pop_back();。

内容

[编辑] 参数

(无)

[编辑] 返回值

(无)

[编辑] 复杂度

对数数量的比较加上 Container::pop_back 的复杂度。

[编辑] 示例

运行此代码
#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';
}

输出

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'}

[编辑] 参见

(C++11)
 就地构造元素并排序底层容器
(public member function) [编辑]
 插入元素并排序底层容器
(public member function) [编辑]
 访问顶部元素
(public member function) [编辑]
Retrieved from "https://cppreference.cn/mwiki/index.php?title=cpp/container/priority_queue/pop&oldid=133083"