This looks a lot more encouraging, I hope it can be adapted for your needs.
I wholeheartedly agree. Those timings make this a much more viable approach. Thank you. I will add it to my benchmarking.
In reply to Re^4: 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: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |