std::priority_queue<T,Container,Compare>::pop (3) - Linux Man Pages

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

NAME

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

Synopsis


void pop();


Removes the top element from the priority queue. Effectively calls std::pop_heap(c.begin(), c.end(), comp); c.pop_back();

Parameters


(none)

Return value


(none)

Complexity


Logarithmic number of comparisons plus the complexity of Container::pop_back.

See also


emplace constructs element in-place and sorts the underlying container
        (public member function)
(C++11)
        inserts element and sorts the underlying container
push (public member function)
        accesses the top element
top (public member function)