News for hackers. Stuff that matters.
Re:A new fast hash table in response to Google’s new fast ha... by bluestreak on Tuesday May 29, 2018 @12:42PM (#17180771)
It does rehash when full. Presumably it would rehash less often than most because it remains stable at very high load factor.

https://en.wikipedia.org/wiki/Radix_tree looks like a funky structure for _very_ specific work loads.

There are no comments on this comment yet.