Re^4: Efficient bit-twiddling in Perl.by BrowserUk (Pope)
|on Feb 28, 2013 at 19:58 UTC||Need Help??|
The lookup table generation is 2/10th second, 1-off cost at startup.
Completely insignificant to the cost of the inner loop lookup code that could theoretically be executed 4 billion times. (Once for each 32-bit number.) More typical is mid 100s to low 1000s of millions of times.
A small saving overall, but only one part of the inner loop code I am optimising. Already down from a couple of weeks to ~4 days.
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.