Undergraduate Upends a 40-Year-Old Data Science Conjecture
Since Perl uses linked lists when collisions occur, most (all?) of this new work seems irrelevant?
What are the methods used in other langauges / implementations?
In my brief research, it seems the only marginally questionable thing that Perl does is not resize based on collisions. It seems, in the worst case, all entries go in the same bucket, but a resize isn't triggered until 75% loading factor is reached?
-QM
--
Quantum Mechanics: The dreams stuff is made of
In reply to Better Hash Tables? by QM
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |