Perl: the Markov chain saw | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
Well I think it depends on the testcase, I tried random numbers in an intervall 1..1e6 like BUK did.
See my benchmark here RFC extending Benchmark.pm to facilitate CODEHASHREF Maybe I did something wrong ... ... but I'm not to keen to continue, IMHO all approaches are already fast enough.
Cheers Rolf ( addicted to the Perl Programming Language)
updateoops undef @hash{@arr} is significantly faster than @hash{@arr}=() In reply to Re^4: Best method to diff very large array efficiently
by LanX
|
|