Bloom Filter & HyperLogLog

Both have been implemented using the std::hash function and 64-bit finaliser from MurmurHash3. See header files for operations supported by each implementation.

Run tests

To run the main test suite (gtest)

$ make

To run the benchmark test comparing the time complexity of Bloom Filter v HyperLogLog v Unordered Set

$ make benchmark