Abhinav Upadhyay on Confessions of a Code Addict

You are right, Kyle. In a real-world implementation I would have used something like MurMur hash which takes a seed as input to serve the need of multiple hash functions required by the Bloom filter. But I wanted to keep it simple and avoid dependencies, in case someone just wanted to play around with this code. In doing so, I made it too simplistic. However, I have improved it a bit by adding more hash functions. Thanks for noticing!