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

Re: Faster Hash Slices

by shmem (Canon)
on Nov 28, 2013 at 13:50 UTC ( #1064827=note: print w/ replies, xml ) Need Help??

in reply to Faster Hash Slices

What Eily says. Then, according to perldata:

You can preallocate space for a hash by assigning to the keys() function. This rounds up the allocated buckets to the next power of two:
keys(%users) = 1000; # allocate 1024 buckets

I'm not sure about the impact on performance, though.

perl -le'print map{pack c,($-++?1:13)+ord}split//,ESEL'

Comment on Re: Faster Hash Slices
Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (8)
As of 2015-10-06 15:34 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (154 votes), past polls