News for hackers. Stuff that matters.
Re:A new fast hash table in response to Google’s new fast ha... by dekhn on Tuesday May 29, 2018 @01:19PM (#17181125)
I guess I get the idea that the O(1) is for the number of entries, but in my experience 99% of prod time is spent hashing keys on amortized O(1) systems, so focusing on the basic complexity theory would seem to be leaving a lot of performance on the table and also contributes confusion.

There are no comments on this comment yet.