Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister

Re: Efficient bit-twiddling in Perl.

by flexvault (Prior)
on Mar 01, 2013 at 11:44 UTC ( #1021231=note: print w/ replies, xml ) Need Help??

in reply to Efficient bit-twiddling in Perl.


This is more about the source of your input (32bit) stream. If it just (0..2**32) and then repeat, then you look like you have the solution now.

But if the input stream is being generated from an analog or digital source and the encoding could have repetition, then using 'memorize' or caching the results in a hash might give you some additional performance.

I once saw an IBM demo that compressed 1 minute of full color video of a football game unto a 360K floppy. IBM's explanation was that so much of the data was repetitious that only the differences from frame to frame was being saved on the floppy.

Just a thought...Ed

"Well done is better than well said." - Benjamin Franklin

Comment on Re: Efficient bit-twiddling in Perl.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1021231]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (2)
As of 2015-11-29 20:41 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (753 votes), past polls