Rust Programming Exercises: Bloom Filters and Bit Vectors

In this video we implement a probabilistic data structure known as a Bloom Filter. We use a simple Vec to store u8 numbers and use bit manipulation to set and get values within the data structure. We also use the fasthash crate in order to take advantage of the murmur3 hash function and we discuss various hashing functions that are commonly used in popular libraries and applications such as Redis and Chromium. Bloom Filters are especially helpful when you need to add a layer in front of your caching infrastructure to avoid overcaching or hitting your storage / disk resources too much for data that doesn't exist or isn't accessed very often. We discuss the use of the bitvec crate as an alternative as well to our implementation for manipulating bits in a large bit array.

↠ References:

Cheers! 🍻

🦀 #rust #rustlang #rustprogramming #exercises #programming

[RobertBMenke]

Loving the content. 2 suggestions for improvement:
1. Break for visuals along the way
2. Show us a practical use case using your implementation.

Thanks for the hard work making this video!

[lifehackspro]

I can't thanks enough what you have done. Keep whats you doing dude! May I suggest, make a similar tools like 'sed'

[HagenvonEitzen]

Is it a good idea to duplicate so much of the code ?

[topdeveloper]

Automatic eng subscription turn on please