Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
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 chilling in the Monastery: (7)
As of 2014-09-01 08:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (299 votes), past polls