comment on

Given a bit vector $v, this: my $c = unpack '%32b*', $v; will count the set bits very efficiently.

However, I need to count the set bits preceding (not including) a given bit position within $v.

I can do that using:

## $p = position
my $c = 0; vec( $v, $_, 1 ) and ++$c for 0 .. $p - 1;
[download]

But that is grossly inefficient for large vectors.

Can you do it more efficiently?

Note:The rest of the code is pure perl, so I'd rather avoid going to XS to do this if possible.

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.

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.