Login Register

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 the underlying container is empty, false otherwise.

Complexity

Constant.

See also

size	returns the number of elements (public member function)

Links:

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

doc_CPP

2025-01-10 15:47:30

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::top const_reference top() const; Returns reference to the top element in the priority queue. This element will be removed on a call to pop(). If