Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Uniform distribution of keys in the buckets

by jmcnamara (Monsignor)
on Mar 29, 2002 at 15:21 UTC ( #155261=note: print w/ replies, xml ) Need Help??

in reply to Uniform distribution of keys in the buckets
in thread Comparing two hash tables

The following will give you some information about the hashing:     print scalar %hash;
See perldata for information: search for "bucket":

This is pretty much useful only to find out whether Perl's internal hashing algorithm is performing poorly on your data set. For example, you stick 10,000 things in a hash, but evaluating %HASH in scalar context reveals `"1/16"', which means only one out of sixteen buckets has been touched, and presumably contains all 10,000 of your items. This isn't supposed to happen.

However, this probably won't help you because you have no control over the hashing mechanism.

Ultimately, the only way for you to answer your question is to use Benchmark.


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://155261]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (11)
As of 2016-06-29 08:13 GMT
Find Nodes?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...

    Results (372 votes). Check out past polls.