Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
miloignis
on March 2, 2020
|
parent
|
context
|
favorite
| on:
When Bloom filters don't bloom
2^32 bytes is 4 GiB, but 2^32 bits is 512 MiB. In the GP's hypothetical array, I believe you would index (array[idx >> 3] >> (idx & 7)) != 0
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: