v0.6

Author: aniketshedge-packt

Lesson03/Exercise01/1.cpp

@@ -9,7 +9,7 @@ class hash_map
 public:
     hash_map(size_t n)
     {
-        data = std::vector(n, -1);
+        data = std::vector<int>(n, -1);
     }
 
     void insert(uint value)

Lesson03/Exercise03/3.cpp

@@ -20,8 +20,8 @@ class hash_map
 public:
     hash_map(int n) : size(n)
     {
-        data1 = std::vector(size, -1);
-        data2 = std::vector(size, -1);
+        data1 = std::vector<int>(size, -1);
+        data2 = std::vector<int>(size, -1);
     }
 
     std::vector<int>::iterator lookup(int key)

Lesson03/Exercise05/5.cpp

@@ -17,12 +17,13 @@ class bloom_filter
         case 2:
             return (key / 11) % nBits;
         }
+        return 0;
     }
 
 public:
     bloom_filter(int n) : nBits(n)
     {
-        data = std::vector(nBits, false);
+        data = std::vector<bool>(nBits, false);
     }
 
     void lookup(int key)