Any thoughts on how to convert $-[0] byte position at which the match is found to a bit position?
In reply to Re^2: Locating a specified number of contiguous 0 bits within a large bitstring efficiently.
by BrowserUk
in thread Locating a specified number of contiguous 0 bits within a large bitstring efficiently.
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |