in reply to Re: how are the number of buckets in a perl hash chosen
in thread how are the number of buckets in a perl hash chosen
It did speak generally about security without going into the gory details. We learned about universal hashing and why it is important.
It was not mentioned that the modulo operation is slow. The fact that the perl hash function manages to spread the entries evenly into buckets, despite the fact that the number of buckets is even is surprising.
I guess that i will have to read the source code to understand exactly how this happens.
This is also what Tim Roughgarden suggests. He says that if we want to understand a data structure well, we should either read a text book about the issue, or an open source implementation.
It was not mentioned that the modulo operation is slow. The fact that the perl hash function manages to spread the entries evenly into buckets, despite the fact that the number of buckets is even is surprising.
I guess that i will have to read the source code to understand exactly how this happens.
This is also what Tim Roughgarden suggests. He says that if we want to understand a data structure well, we should either read a text book about the issue, or an open source implementation.
|
|---|
In Section
Seekers of Perl Wisdom