3 ms·
I've benchmarked swiss tables and found that (for hit-heavy workloads) a minimum of 2 loads per lookup is expensive compared to 1.
by anonymoushn 4y ago
I've benchmarked swiss tables and found that (for hit-heavy workloads) a minimum of 2 loads per lookup is expensive compared to 1.
- adgjlsfhk1 4y agoI've really wanted to try making a hash table that works like a Swiss table but that stores the metadata interleaved with the rest of the data (16 metadata, 16 key, 16 value, repeat). doing so would keep your memory accesses closer together, but be a pain to program