in reply to Re: 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.

Set::IntSpan::* family of modules have to do something like this in order to implement the "holes" and "cover"

This is a interesting idea. Thanks.

However, Set::IntSpan that has those interesting methods seems to be both memory hungry and slow.

The neither of the faster, more memory lean modules, Set::IntSpan::Fast & Set::IntSpan::Fast::XS do :(

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.

In Section Seekers of Perl Wisdom