Skip to content

Comment on Hash tablesparent

Comments

Even if the list is fully in L1 at best you'll be able to check an element every 5-6 cycles. With open addressing you can test at least 2 elements per clock cycle, many more with SIMD.

Edit: somehow I missed your mention of partially unrolled lists. Those can of course mitigate many of the downsides.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.