mirror of
https://github.com/adambard/learnxinyminutes-docs.git
synced 2024-11-26 20:34:32 +03:00
Merge pull request #3321 from ankushagarwal/patch-1
[c++/en] Add comments about unordered_map and unordered_set
This commit is contained in:
commit
0b8fd8ff21
@ -1057,6 +1057,8 @@ cout << ST.size(); // will print the size of set ST
|
||||
// Output: 0
|
||||
|
||||
// NOTE: for duplicate elements we can use multiset
|
||||
// NOTE: For hash sets, use unordered_set. They are more effecient but
|
||||
// do not preserve order. unordered_set is available since C++11
|
||||
|
||||
// Map
|
||||
// Maps store elements formed by a combination of a key value
|
||||
@ -1084,6 +1086,8 @@ cout << it->second;
|
||||
|
||||
// Output: 26
|
||||
|
||||
// NOTE: For hash maps, use unordered_map. They are more effecient but do
|
||||
// not preserve order. unordered_map is available since C++11.
|
||||
|
||||
///////////////////////////////////
|
||||
// Logical and Bitwise operators
|
||||
|
Loading…
Reference in New Issue
Block a user