Login Register

std::priority_queue::pop

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 (C++11)	constructs element in-place and sorts the underlying container (public member function)
push	inserts element and sorts the underlying container (public member function)
top	accesses the top element (public member function)

Links:

http://en.cppreference.com/w/cpp/container/priority_queue/pop

doc_CPP

2016-10-11 10:05:48

Comments

Leave a Comment

Please login to continue.

Popular Articles

std::priority_queue Defined in header <queue> template< class T, class Container = std::vector<T>, class Compare = std::less<typena

std::priority_queue::priority_queue (1) explicit priority_queue( const Compare& compare = Compare(), const Container& cont = Container() ); (until

std::priority_queue::push void push( const T& value ); void push( T&& value ); (since C++11) Pushes the given element value to the priority queue. 1

std::priority_queue::size size_type size() const; Returns the number of elements in the underlying container, that is, c.size(). Parameters (none). Return value

std::priority_queue::empty bool empty() const; Checks if the underlying container has no elements, i.e. whether c.empty(). Parameters (none). Return value true if