[racket] Bloom filter?

From: Robby Findler (robby at eecs.northwestern.edu)
Date: Mon Jun 6 11:45:12 EDT 2011

On Mon, Jun 6, 2011 at 8:24 AM, Erich Rast <erich at snafu.de> wrote:
> I had something similar in mind but was wondering about the
> space-efficiency of a vector of booleans. Does the compiler represent
> this as a memory area where each boolean corresponds to a single bit?

It does not. The simplest way to do something like that in Racket is
to use an exact integer to represent your set and use the bitwise
operations to adjust the set (if the set has 30 or fewer members (62
on a 64 bit build) then there won't be any allocation for new sets).


Posted on the users mailing list.