[racket-dev] bit-vectors and serialization

From: Pierpaolo Bernardi (olopierpa at gmail.com)
Date: Tue Dec 18 04:56:56 EST 2012

On Mon, Dec 17, 2012 at 10:35 PM, Ryan Culpepper <ryan at cs.utah.edu> wrote:

> True, popcount takes about three times as long as it used to. With a few
> additional changes, popcount on a million-bit bit-vector takes 1.1 ms using
> bytes, as opposed to 0.35 ms using fxvectors. (Tested on a 64-bit machine.)

I seem to understand that popcount still uses the same trick as the
fixnum version?

Have you tried using a byte-vector of 256 precomputed values for each
byte value?

P.

Posted on the dev mailing list.