On Mon, Dec 17, 2012 at 10:35 PM, Ryan Culpepper <r...@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. _________________________ Racket Developers list: http://lists.racket-lang.org/dev
