- The C Standard Library
- The C Standard Library
- The C++ Standard Library
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
C++ Map Library - count() Function
Description
The C++ function std::map::count() returns number of mapped values associated with key k.
As this container does not allow duplicates value is alway either 0 or 1.
Declaration
Following is the declaration for std::map::count() function form std::map header.
C++98
size_type count (const key_type& k) const;
Parameters
k − Key for search operation.
Return value
Returns 1 if container has value associated with key k otherwise 0.
Exceptions
This member function doesn't throw exception.
Time complexity
Logarithmic i.e. log(n).
Example
The following example shows the usage of std::map::count() function.
#include <iostream> #include <map> using namespace std; int main(void) { /* Initializer_list constructor */ map<char, int> m = { {'a', 1}, {'b', 2}, {'c', 3}, {'d', 4}, {'e', 5}, }; if (m.count('a') == 1) { cout << "m['a'] = " << m.at('a') << endl; } if (m.count('z') == 0) { cout << "Value not present for key m['z']" << endl; } return 0; }
Let us compile and run the above program, this will produce the following result −
m['a'] = 1 Value not present for key m['z']
map.htm
Advertisements