Re: Re: Subroutines: Returning a hash vs. hash reference

[mt2k]

/me mutters something along the lines of "Why didn't I think of that?" :)

Anyhow, I went as far as 2000x2000 and got the following results:

return hash takes: 32 secs
return hash REF takes: 11 secs

This demonstrates that hash REFs do indeed run much faster. I suppose that returning a regular hash requires that the interpreter copy the data structure... likely doubling the memory required to keep the data structure memorized.

Thanks a lot, I do believe I have got an answer to my "problem".

[BrowserUk]

It's actually worse than just copying the data structure...it first flattens the structure to a list of (key0, value0, key1, value1,...) then has to re-construct the hash by re-hashing all the keys. Its the latter part that takes most of the time.

---

Okay you lot, get your wings on the left, halos on the right. It's one size fits all, and "No!", you can't have a different color.
Pick up your cloud down the end and "Yes" if you get allocated a grey one they are a bit damp under foot, but someone has to get them.
Get used to the wings fast cos its an 8 hour day...unless the Govenor calls for a cyclone or hurricane, in which case 16 hour shifts are mandatory.
Just be grateful that you arrived just as the tornado season finished. Them buggers are real work.