Reference
C Library
IOstream Library
Strings library
STL Containers
STL Algorithms
Miscellaneous
STL Containers
bitset
deque
list
map
multimap
multiset
priority_queue
queue
set
stack
vector
priority_queue
priority_queue::priority_queue
member functions:
priority_queue::empty
priority_queue::pop
priority_queue::push
priority_queue::size
priority_queue::top


priority_queue::empty

public member function
bool empty ( ) const;

Test whether container is empty

Returns whether the priority_queue is empty, i.e. whether its size is 0.

This member function effectively calls the member with the same name in the underlying container object.

Parameters

none

Return Value

true if the container size is 0, false otherwise.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
// priority_queue::empty
#include <iostream>
#include <queue>
using namespace std;
int main ()
{
  priority_queue<int> mypq;
  int sum (0);
  for (int i=1;i<=10;i++) mypq.push(i);
  while (!mypq.empty())
  {
     sum += mypq.top();
     mypq.pop();
  }
  cout << "total: " << sum << endl;
  
  return 0;
}

The example initializes the content of the priority queue to a sequence of numbers (form 1 to 10). It then pops the elements one by one until it is empty and calculates their sum.

Output:
total: 55

Complexity

Constant.

See also