Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^4: performance of counting keys in a big hash

by space_monk (Chaplain)
on May 22, 2013 at 12:19 UTC ( #1034731=note: print w/ replies, xml ) Need Help??


in reply to Re^3: performance of counting keys in a big hash
in thread performance of counting keys in a big hash

I'm just in the process of tidying up my comment by putting in some code that actually works, as opposed to that I first thought of! :-).

I think reversing the tests is probably enough proof; I don't believe separate scripts would prove anything extra.

I am using Benchmark to compare my results instead of using manual timing.

If you spot any bugs in my solutions, it's because I've deliberately left them in as an exercise for the reader! :-)


Comment on Re^4: performance of counting keys in a big hash

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (4)
As of 2014-12-22 05:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (110 votes), past polls