sub shuffleEm {
( shuffle 1 .. $range )[ 0 .. $uSize ];
}
To your benchmark: cmpthese( -1, {
grepGen => sub{ @grep = grepGen(); },
mapGen => sub{ @map = mapGen(); },
smartGen => sub{ @smart = smartGen(); },
shuffleEm=> sub{ @shuffled = shuffleEm() },
} );
And got these times: C:\test>junk
Rate grepGen mapGen smartGen shuffleEm
grepGen 35.3/s -- -51% -97% -100%
mapGen 72.6/s 106% -- -94% -100%
smartGen 1250/s 3439% 1621% -- -95%
shuffleEm 26859/s 75977% 36902% 2049% --
And that doesn't include the time and memory you waste building your pointless pool of 1M values.
But hey. It's your time you are wasting.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
|