STL_map——map::count

Reference:
Returns the number of elements in a map whose key matches a parameter-specified key.

Function:
size_type count(
   const Key& _Key
) const;

Parameter:
_Key:The key value of the elements to be matched from the map.

Return Value:
1 if the map contains an element whose sort key matches the parameter key; 0 if the map does not contain an element with a matching key.

Remarks:
The member function returns the number of elements x in the range
[lower_bound (_Key ), upper_bound (_Key ) )
which is 0 or 1 in the case of map, which is a unique associative container.

Example:

#include <map>
#include <iostream>

int main( )
{
   using namespace std;
   map <int, int> m1;
   int i;
   typedef pair <int, int> Int_Pair;

   m1.insert ( Int_Pair ( 1, 1 ) );
   m1.insert ( Int_Pair ( 2, 1 ) );
   m1.insert ( Int_Pair ( 1, 4 ) );
   m1.insert ( Int_Pair ( 2, 1 ) );
   
   // Keys must be unique in map, so duplicates are ignored
   i = m1.count( 1 );
   cout << "The number of elements in m1 with a sort key of 1 is: "
        << i << "." << endl;

   i = m1.count( 2 );
   cout << "The number of elements in m1 with a sort key of 2 is: "
        << i << "." << endl;

   i = m1.count( 3 );
   cout << "The number of elements in m1 with a sort key of 3 is: "
        << i << "." << endl;
}

Output:
The number of elements in m1 with a sort key of 1 is: 1.
The number of elements in m1 with a sort key of 2 is: 1.
The number of elements in m1 with a sort key of 3 is: 0.