3 ms·
Pretty much. There's a reason that there's no wikipedia page for this algorithm (where there is for Bloom Filter, of course) -- it's just a hash table without
by ajross 14y ago
Pretty much. There's a reason that there's no wikipedia page for this algorithm (where there is for Bloom Filter, of course) -- it's just a hash table without chaining (i.e. it simply drops collisions).
- NovaX 14y agoIts called a direct mapped cache: http://en.wikipedia.org/wiki/CPU_cache#Direct-mapped_cache http://en.wikipedia.org/wiki/CPU_cache#Direct-mapped_cache