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

I guess just see how many high bits are zero in the byte at position $-[0] ?

Dave.

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