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
multimap
comparison operators
multimap::multimap
multimap::~multimap
member functions:
multimap::begin
multimap::clear
multimap::count
multimap::empty
multimap::end
multimap::equal_range
multimap::erase
multimap::find
multimap::get_allocator
multimap::insert
multimap::key_comp
multimap::lower_bound
multimap::max_size
multimap::operator=
multimap::rbegin
multimap::rend
multimap::size
multimap::swap
multimap::upper_bound
multimap::value_comp


multimap::clear

public member function
void clear ( );

Clear content

All the elements in the 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
28
29
// multimap::clear
#include <iostream>
#include <map>
using namespace std;
int main ()
{
  multimap<char,int> mymultimap;
  multimap<char,int>::iterator it;
  mymultimap.insert(pair<char,int>('b',80));
  mymultimap.insert(pair<char,int>('b',120));
  mymultimap.insert(pair<char,int>('q',360));
  cout << "mymultimap contains:\n";
  for ( it=mymultimap.begin() ; it != mymultimap.end(); it++ )
    cout << (*it).first << " => " << (*it).second << endl;
  mymultimap.clear();
  mymultimap.insert(pair<char,int>('a',11));
  mymultimap.insert(pair<char,int>('x',22));
  cout << "mymultimap contains:\n";
  for ( it=mymultimap.begin() ; it != mymultimap.end(); it++ )
    cout << (*it).first << " => " << (*it).second << endl;
  return 0;
}


Output:
mymultimap contains:
b => 80
b => 120
q => 360
mymap contains:
a => 11
x => 22

Complexity

Linear in size (destructors).

See also