Add comments about unordered_map and unordered_set

This commit is contained in:
Ankush Agarwal 2018-10-22 08:44:21 -07:00 committed by GitHub
parent 88e24ff1a4
commit 129abf6113
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

View File

@ -1027,6 +1027,7 @@ for (it = my_vector.begin(); it != my_vector.end(); ++it) {
// Set // Set
// Sets are containers that store unique elements following a specific order. // Sets are containers that store unique elements following a specific order.
// For hash sets, use unordered_set. They are more effecient but do not preserve order.
// Set is a very useful container to store unique values in sorted order // Set is a very useful container to store unique values in sorted order
// without any other functions or code. // without any other functions or code.
@ -1061,6 +1062,7 @@ cout << ST.size(); // will print the size of set ST
// Map // Map
// Maps store elements formed by a combination of a key value // Maps store elements formed by a combination of a key value
// and a mapped value, following a specific order. // and a mapped value, following a specific order.
// For hash maps, use unordered_map. They are more effecient but do not preserve order.
#include<map> #include<map>
map<char, int> mymap; // Will initialize the map with key as char and value as int map<char, int> mymap; // Will initialize the map with key as char and value as int