in reply to Re: About the expected number of comparisons for n keys into k buckets
in thread About the expected number of comparisons for n keys into k buckets

According to the definition of quality, I think it's not related with the exact implementation of hash:

The "quality" of a hash is defined as the total number of comparisons needed to access every element once, relative to the expected number needed for a random hash. The value can go over 100%.
  • Comment on Re^2: About the expected number of comparisons for n keys into k buckets

In Section Seekers of Perl Wisdom