28 Jan
2017
28 Jan
'17
1:44 a.m.
On Fri, Jan 27, 2017 at 1:12 AM, Frank Staals <frank@fstaals.net> wrote:
It would be awesome if there was some sort of cuckoo-hashing implementation that you could build in ST (in expected O(n) time or so), and then freeze as to get O(1) worst case (guaranteed) lookups in pure code.
There is a version of cuckoo hashing in the hashtables <https://github.com/gregorycollins/hashtables> library that is in ST, but it doesn't do freeze, sorry. I decided not to add freeze -- it would have more than doubled the API footprint for very little benefit. G -- Gregory Collins <greg@gregorycollins.net>