[racket-dev] Implementation of bit vectors

From: Pierpaolo Bernardi (olopierpa at gmail.com)
Date: Tue Nov 27 06:18:02 EST 2012

On Sat, Nov 24, 2012 at 8:33 PM, Jens Axel Søgaard
<jensaxel at soegaard.net> wrote:
> Hi All,
> I have written an implementation of bit vectors intended to be part of
> the data collection.
>     https://github.com/plt/racket/pull/176
> Any comments on the implementation and documentation are welcome.
> The bit vector is represented as a vector of fixnums (packaged in a
> struct of course).

I seem to understand that you do not exploit the packed representation
of bits in the iteration construct, is this right?

Also, you store and retrieve booleans, not bits, so the name
'bit-vector' is misleading.

'find' and 'count' operations optimized for the representation would
be a useful addition.


Posted on the dev mailing list.