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::clear

public member function
void clear ( );

Clear content

All the elements in the deque container are dropped: their destructors are called, and then they are removed from the container, leaving it with a size of 0.

Parameters

none

Return value

none

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
 
// clearing deques
#include <iostream>
#include <deque>
using namespace std;
int main ()
{
  unsigned int i;
  deque<int> mydeque;
  mydeque.push_back (100);
  mydeque.push_back (200);
  mydeque.push_back (300);
  cout << "mydeque contains:";
  for (i=0; i<mydeque.size(); i++) cout << " " << mydeque[i];
  mydeque.clear();
  mydeque.push_back (1101);
  mydeque.push_back (2202);
  cout << "\nmydeque contains:";
  for (i=0; i<mydeque.size(); i++) cout << " " << mydeque[i];
  cout << endl;
  return 0;
}


Output:
mydeque contains: 100 200 300
mydeque contains: 1101 2202

Complexity

Linear on size (destructors).

See also

deque::erase Erase elements (public member function)
deque::resize Change size (public member functions)
deque::pop_back Delete last element (public member function)
deque::pop_front Delete first element (public member function)
deque::empty Test whether container is empty (public member function)