Re^6: Locating a specified number of contiguous 0 bits within a large bitstring efficiently.by BrowserUk (Pope)
|on Jun 07, 2013 at 20:23 UTC||Need Help??|
By way of example, this generates a vector with a single length 1x0 run, and a single length 2x0 run; and single length 3x0 run; and so on:
Thus, a search for
Running your code looking for these runs against that vector produces:
I believe this is because little-endian bytes are bytes swapped and word swapped relative to big-endian.
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.