Live data from Hacker News

Advanced techniques to implement fast hash tables

attractivechaos.wordpress.com

21–22 of 22 posts

Re: Advanced techniques to implement fast hash tables

#21
post #20

Earlier quoted context omitted.

How does that compare to the dict implementation of Python 3.6 ? It's supposed to be damned fast but I don't have the skills to make such comparisons.

Python, ruby, php hash tables are roughly 2x slower. perl5's being the worst maybe 4x slower. Damn fast is only relative. It's damn fast compared to the previous implementations. Wikipedia even dares to say that the worst hash tables of all, perl5, is one of the very best. Bias all over. SIMD optimized hash tables, such as the Swiss tables tricks have the potential to be much faster than khash. And khash is not cache…

Does it preserves insertion order ?

Re: Advanced techniques to implement fast hash tables

#22
post #20

Earlier quoted context omitted.

Python, ruby, php hash tables are roughly 2x slower. perl5's being the worst maybe 4x slower. Damn fast is only relative. It's damn fast compared to the previous implementations. Wikipedia even dares to say that the worst hash tables of all, perl5, is one of the very best. Bias all over. SIMD optimized hash tables, such as the Swiss tables tricks have the potential to be much faster than khash. And khash is not cache…

Does it preserves insertion order ?

Of course not. hash table iteration should assume random order, otherwise it's a security risk or performance nightmare.
Post reply on HN