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

This is a valuable comment, I had not thought of that. I have reversed the order and get the same results. Does this provide enough proof or could there be a caveat as well?

To be really sure one would have to run separate scripts?

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

Replies are listed 'Best First'.
Re^4: performance of counting keys in a big hash by space_monk (Chaplain) on May 22, 2013 at 12:19 UTC
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! :-)	[reply]

Replies are listed 'Best First'.

Re^4: performance of counting keys in a big hash
by space_monk (Chaplain) on May 22, 2013 at 12:19 UTC

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! :-)

[reply]