Re:A new fast hash table in response to Google’s new fast ha...
by whatshisface on Tuesday May 29, 2018 @08:20AM
(#17178432)
The parent's claim implies that on a machine with an abstract cache, the complexity of hashmaps could be proven to be something else. You may be able to recover the right behaivor by modeling a machine with infinite memory, divided up into an infinite tower of caches where each level was P times bigger and Q times slower.
[ Parent
| on HN ]
There are no comments on this comment yet.