summaryrefslogtreecommitdiffhomepage
diff options
context:
space:
mode:
authorAnkush Agarwal <ankushagarwal11@gmail.com>2018-10-22 09:12:29 -0700
committerGitHub <noreply@github.com>2018-10-22 09:12:29 -0700
commit2e6208c754becae469c4056ac9ecdea40f490064 (patch)
treed97ecee23ed0715932b77ff92bc7e4d92fce1b1f
parent129abf6113a48f928b5b8b47a54ff60184947cea (diff)
Update comments
-rw-r--r--c++.html.markdown6
1 files changed, 4 insertions, 2 deletions
diff --git a/c++.html.markdown b/c++.html.markdown
index f1ad0790..225472cb 100644
--- a/c++.html.markdown
+++ b/c++.html.markdown
@@ -1027,7 +1027,6 @@ for (it = my_vector.begin(); it != my_vector.end(); ++it) {
// Set
// 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
// without any other functions or code.
@@ -1058,11 +1057,12 @@ 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
// 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>
map<char, int> mymap; // Will initialize the map with key as char and value as int
@@ -1086,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