Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
For the record your second solution corrupts the hash with keys whose value is undef. While the OP didnt explicitly say this was bad, I believe it was implicit in the comment that the keys could be very large or very small. Thus a search could inadverdantly create millions of keys and overflow available RAM. --- demerphq <Elian> And I do take a kind of perverse pleasure in having an OO assembly language... In reply to Re: Re^2: calculate average from range of hash values (optimize)
by demerphq
|
|