Category: unordered_map
Unordered_map Usage Tutorial and Example
In this article we will discuss what is unordered_map and how it use it. What is an unordered_map Unordered_map provides a functionality of map i.e. it store the elements in key value pair and with unique key only. Advertisements Unordered_map internally uses the hashing to achieve this. It internally uses a hash table to implement …
How to iterate over an unordered_map in C++11
In this article we will discuss the different ways to iterate over an unordered_map. First lets create an unordered_map and then we will see the different ways to iterate over it. // Initialize an unordered_map through initializer_list std::unordered_map<std::string, int> wordMap({{ “First”, 1 },{ “Second”, 2 },{ “Third”, 3 }}); Iterating an unordered_map using range based …
Different Ways to initialize an unordered_map
In this article we will discuss the different ways to initialize an unordered_map. unordered_map provides different overloaded constructors. We will use some of them to initialize an unordered_set in 3 different ways i.e. Initializing through an initializer_list Initializing through a iterable range. Initializing through an another map. Lets see them in detail, Advertisements Initializing an unordered_map …
Different ways to insert elements in an unordered_map
In this article we will discuss the different ways to insert elements in an unordered_map. Unordered_map provides different overloaded versions of insert() member function to insert key value pairs in an unordered_map. Lets discuss them one by one. Advertisements Inserting multiple elements in unordered_map through an initializer_list unordered_map provides an overloaded version of insert that …
Different ways to insert elements in an unordered_mapRead More
c++11 unordered_map : erase elements while iterating in a loop
In this article we will discuss how to erase multiple elements from an unordered_map based on some condition and while iterating. Erasing Multiple elements from unordered_map while iterating Suppose we have an unordered_map of string and integers as key value pairs i.e. Advertisements First : 1 Second : 2 Third : 3 Fourth :  4 Fifth : 5 …
c++11 unordered_map : erase elements while iterating in a loopRead More
How to find an element in unordered_map
In this article we will discuss how to find an element in an unordered_map. An unordered_map store elements in key – value pair. Hence to search an element we need to search if the key exists in an unordered_map or not. For this unordered_map provides a member function find() i.e. Advertisements iterator find ( const …
How to Erase / Remove an element from an unordered_map
In this article we will discuss the different ways to remove an element from an unordered_map. Unordered_map provides different overloaded version of erase() member function to delete key value pairs from map. Advertisements Erasing an element from an unordered_map by key Unordered_map provides following overloaded version of erase() that accepts a key by value and …
How to Erase / Remove an element from an unordered_mapRead More
map vs unordered_map | When to choose one over another ?
In this article we will compare std::map and std::unordered_map and will also discuss when to choose one over another. Both std::map & std::unordered_map store elements in key value pair & provide member functions to efficiently insert, search & delete key value pairs. Advertisements But they are different in following areas, Internal Implementation Memory Usage Time …
map vs unordered_map | When to choose one over another ?Read More