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
deque
comparison operators
deque::deque
deque::~deque
member functions:
deque::assign
deque::at
deque::back
deque::begin
deque::clear
deque::empty
deque::end
deque::erase
deque::front
deque::get_allocator
deque::insert
deque::max_size
deque::operator=
deque::operator[]
deque::pop_back
deque::pop_front
deque::push_back
deque::push_front
deque::rbegin
deque::rend
deque::resize
deque::size
deque::swap


deque::empty

public member function
bool empty ( ) const;

Test whether container is empty

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

This function does not modify the content of the container in any way. To clear the content of a deque container, use deque::clear.

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
// deque::empty
#include <iostream>
#include <deque>
using namespace std;
int main ()
{
  deque<int> mydeque;
  int sum (0);
  for (int i=1;i<=10;i++) mydeque.push_back(i);
  while (!mydeque.empty())
  {
     sum += mydeque.front();
     mydeque.pop_front();
  }
  cout << "total: " << sum << endl;
  
  return 0;
}

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