Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Efficient bit counting with a twist.

by AnomalousMonk (Monsignor)
on Jan 27, 2013 at 09:48 UTC ( #1015571=note: print w/ replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    >perl -wMstrict -le
    "my $b = qq{\x01\x03\x07\xff\xfe\xfc};
    ...
    before bit at offset 30: 12 bits set
    before bit at offset 31: 13 bits set
    before bit at offset 32: 14 bits set
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (14)
As of 2014-07-22 16:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (119 votes), past polls