Re:Writing a Very Fast Hash Table with Tiny Memory Footprints
by Veedrac on Wednesday May 10, 2017 @10:36AM
(#14308511)
If you're looking for elements by identity, that's going to be really slow. Hash maps are designed precisely to handle that scenario, and devolving to linear scans is only going to make things worse.
[ Parent
| on HN ]
There are no comments on this comment yet.