Re^2: How to access a static hash.

I was testing what I thought I was testing. What I don't understand is why Perl can't or doesn't optimize this case.
Now if only I can learn to read the output of Benchmark.

-- gam3
A picture is worth a thousand words, but takes 200K.

Comment on Re^2: How to access a static hash.

Replies are listed 'Best First'.
Re^3: How to access a static hash. by Joost (Canon) on Mar 17, 2007 at 21:00 UTC
Ok, then I misunderstood your first code snippet. Note that the hash creation/deletion can only be optimized away if the content of the hash is constant (ie it would require extra analyzing code). I would guess it's possible to optimize it, but I don't think your construct is widely used (it's also fairly limited, since you can only access the hash once before it goes out of scope), so it probably won't really solve any "real-world" performance issues. As for the Benchmark output, I always find the "Rate - XXXX/s" results the easiest to interpret: those are just the number of calls completed per second, so higher is faster. "What should it profit a man, if he should win a flame war, yet lose his cool?"	[reply]

Replies are listed 'Best First'.

Re^3: How to access a static hash.
by Joost (Canon) on Mar 17, 2007 at 21:00 UTC

Note that the hash creation/deletion can only be optimized away if the content of the hash is constant (ie it would require extra analyzing code). I would guess it's possible to optimize it, but I don't think your construct is widely used (it's also fairly limited, since you can only access the hash once before it goes out of scope), so it probably won't really solve any "real-world" performance issues.

As for the Benchmark output, I always find the "Rate - XXXX/s" results the easiest to interpret: those are just the number of calls completed per second, so higher is faster.

"What should it profit a man, if he should win a flame war, yet lose his cool?"

[reply]