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
queue
comparison operators
queue::queue
member functions:
queue::back
queue::empty
queue::front
queue::pop
queue::push
queue::size


queue::empty

public member function
bool empty ( ) const;

Test whether container is empty

Returns whether the 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
// queue::empty
#include <iostream>
#include <queue>
using namespace std;
int main ()
{
  queue<int> myqueue;
  int sum (0);
  for (int i=1;i<=10;i++) myqueue.push(i);
  while (!myqueue.empty())
  {
     sum += myqueue.front();
     myqueue.pop();
  }
  cout << "total: " << sum << endl;
  
  return 0;
}

The example initializes the content of the 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