Too Long; Didn't Read
I recently ran across <a href="http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/" target="_blank">this bloom filter post by Michael Schmatz</a> and it inspired me to write about a neat variation on <a href="https://en.wikipedia.org/wiki/Bloom_filter" target="_blank">the bloom filter</a> that I’ve found useful in my work. Quick refresher: a bloom filter is a probabilistic <a href="https://hackernoon.com/tagged/data-structure" target="_blank">data structure</a> that tests if an element is <a href="https://hackernoon.com/tagged/potentially" target="_blank">potentially</a> in a set. False positives are possible when testing if an element is in the set, but negatives mean an element is definitely not in the set. Got it? Cool.