Re^2: Locating a specified number of contiguous 0 bits within a large bitstring efficiently.

Any thoughts on how to convert $-[0] byte position at which the match is found to a bit position?

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.

Comment on Re^2: Locating a specified number of contiguous 0 bits within a large bitstring efficiently.

Replies are listed 'Best First'.
Re^3: Locating a specified number of contiguous 0 bits within a large bitstring efficiently. by dave_the_m (Monsignor) on Jun 07, 2013 at 13:13 UTC
I guess just see how many high bits are zero in the byte at position $-[0] ? Dave.	[reply]