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

public member function
bool empty ( ) const;

Test whether container is empty

Returns whether the multimap 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 its content, use member 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
// multimap::empty
#include <iostream>
#include <map>
using namespace std;
int main ()
{
  multimap<char,int> mymultimap;
  mymultimap.insert (pair<char,int>('b',101));
  mymultimap.insert (pair<char,int>('b',202));
  mymultimap.insert (pair<char,int>('q',505));
  while (!mymultimap.empty())
  {
     cout << mymultimap.begin()->first << " => ";
     cout << mymultimap.begin()->second << endl;
     mymultimap.erase(mymultimap.begin());
  }
  return 0;
}


Output:
b => 101
b => 202
q => 505

Complexity

Constant.

See also