unordered_map cbegin in C++ STL

unordered_map count() in C++

Last Updated : 26 Sep, 2018

The unordered_map::count() is a builtin method in C++ which is used to count the number of elements present in an unordered_map with a given key. Note: As unordered_map does not allow to store elements with duplicate keys, so the count() function basically checks if there exists an element in the unordered_map with a given key or not. Syntax:

size_type count(Key);

Parameters: This function accepts a single parameter key which is needed to be checked in the given unordered_map container. Return Value: This function returns 1 if there exists a value in the map with the given key, otherwise it returns 0. Below programs illustrate the unordered_map::count() function: Program 1:

CPP

// C++ program to illustrate the 
// unordered_map::count() function

#include<iostream>
#include<unordered_map>

using namespace std;

int main()
{
    // unordered map
    unordered_map<int , string> umap;
    
    // Inserting elements into the map
    umap.insert(make_pair(1,"Welcome"));
    umap.insert(make_pair(2,"to"));
    umap.insert(make_pair(3,"GeeksforGeeks"));
    
    // Check if element with key 1 is present using 
    // count() function
    if(umap.count(1))
    {
        cout<<"Element Found"<<endl;
    }
    else
    {
        cout<<"Element Not Found"<<endl;    
    }
    
    return 0;
}

Output:

Element Found

Program 2:

CPP

// C++ program to illustrate the 
// unordered_map::count() function

#include<iostream>
#include<unordered_map>

using namespace std;

int main()
{
    // unordered map
    unordered_map<int , string> umap;
    
    // Inserting elements into the map
    umap.insert(make_pair(1,"Welcome"));
    umap.insert(make_pair(2,"to"));
    umap.insert(make_pair(3,"GeeksforGeeks"));
    
    // Try inserting element with
    // duplicate keys
    umap.insert(make_pair(3,"CS Portal"));
    
    // Print the count of values with key 3
    // to check if duplicate values are stored 
    // or not
    cout<<"Count of elements in map, mapped with key 3: "
            <<umap.count(3);
    
    return 0;
}

Output:

Count of elements in map, mapped with key 3: 1

unordered_map cbegin in C++ STL

S

Sektor_jr

Improve

Article Tags :

C++

Practice Tags :

CPP

Similar Reads

unordered_map at() in C++

In C++, unordered_map at() is a library function used to find the value associated with a given key in the unordered_map container. Let's look at an example to see how to use this function.C++#include <bits/stdc++.h> using namespace std; int main() { unordered_map<int, string> um = {{1,

unordered_map cend in C++ STL

The unordered_map::cend() is a built-in function in C++ STL which returns an iterator pointing to the position past the end element in the container or in one of its bucket. In an unordered_map object, there is no guarantee that which specific element is considered its first element. But all the ele

unordered_map begin() in C++

The unordered_map::begin() is a built-in function in C++ STL which returns an iterator pointing to the first element in the unordered_map container or in any of its bucket. Syntax for first element in unordered_map container: unordered_map.begin() Parameters: This function does not accepts any param

unordered_map cbegin in C++ STL

cbegin function in c++ is used to return a constant iterator pointing the first element in an unordered map. Syntax: unordered_map.cbegin() Parameter: It takes an optional parameter N. If set, the iterator returned will point to the first element of the bucket otherwise it point to the first element

unordered_map find in C++ STL

In C++, std::unordered_map::find function is used to search for a specific element using the key in an unordered map container. It is a member function of std::unordered_map container defined inside <unordered_map> header file.Syntaxum.find(key);Parameterskey: The key of the element to be sear

Unordered Map in C++ STL

In C++, unordered_map is an unordered associative container that stores data in the form of unique key-value pairs. But unlike map, unordered map stores its elements using hashing. This provides average constant-time complexity O(1) for search, insert, and delete operations but the elements are not

unordered_map empty in C++ STL

unordered_map::empty() function is used to check whether container size is zero or not. If container size is zero then it return TRUE otherwise it return FALSE. Syntax: unordered_map_name.empty() Parameters: This function does not accept any parameter Return type: This function returns boolean value

unordered_map clear in C++ STL

unordered_map::clear() function is used to remove all elements from the container. When this function is applied to unordered_map its size becomes zero. Syntax: unordered_map_name.clear() Parameters: This function does not accepts any parameter Return type: This function return nothing. Examples: In

unordered_map max_bucket_count in C++ STL

The unordered_map::max_bucket_count is a built in function in C++ STL. It returns the maximum number of buckets unordered_map container can have. Syntax unordered_map.max_bucket_count() Parameters : It does not accept any parameter. Return Type : Returns maximum number of buckets. Return type is an

unordered_map bucket() in C++ STL

The unordered_map::bucket() is a built-in STL function in C++ which returns the bucket number where the element with the key k is located in the map. Syntax: size_type bucket(key) Parameter: The function accepts one mandatory parameter key which specifies the key whose bucket number is to be returne