6 ms·
This is the benchmark they wrote: https://github.com/eliben/code-for-blog/blob/7278526923168d21e13778f8bf40cb3fd742dd63/2025/bloom/bloom_test.go#L177-L205 https
by returningfory2 1y ago
This is the benchmark they wrote: https://github.com/eliben/code-for-blog/blob/7278526923168d21e13778f8bf40cb3fd742dd63/2025/bloom/bloom_test.go#L177-L205 https://github.com/eliben/code-for-blog/blob/7278526923168d2...
The benchmark alternates between ~1 million different keys to check in the filter, explicitly to account for cache effects.
- Tuna-Fish 1y agoA single lookup is going to take more than 30ns, the reason they only see that is that the OoO machinery of their CPU is good enough to run those lookups in parallel.