|Perl: the Markov chain saw|
Re^2: Efficient bit counting with a twist.by BrowserUk (Pope)
|on Jan 27, 2013 at 23:50 UTC||Need Help??|
Using it to count set bits in the whole bytes before your position and then, if necessary, those bits in the partial byte up to but not including it via a mask might be viable.
Ie. To recognise that the unpack template '%32b*' is not a indivisible token saying 'count the bits', but actually contains 3 parts:
And that by simply interpolating $p into the template, in place of *, it counts the set bits within the first $p bits of the string.
Perl had the problem solved; I just didn't recognise it :) (Hence my: D'oh! D'oh! D'oh!..... moment. :)
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.