3 ms·
> Lets you test if a value is definitely NOT in a list of pre-stored values wouldn’t a hashmap / dict / object do this in 0(1)? Input goes in, is hashed, the k
by nailer 4y ago
> Lets you test if a value is definitely NOT in a list of pre-stored values
wouldn’t a hashmap / dict / object do this in 0(1)? Input goes in, is hashed, the key exists or doesn’t exist?
- tomsmeding 4y agoThe point of a Bloom filter is that it takes constant memory. (The tradeoff is the possibility of false-positives, of course.)