Faster IntSet by using BitMaps in the lower branches

Gregory Collins greg at
Mon Sep 19 16:03:39 CEST 2011

On Sun, Sep 18, 2011 at 11:07 PM, Edward Kmett <ekmett at> wrote:
> There are some neat tricks you can use using deBruijn multiplication to
> optimize finding the least significant set bit.
> My geometric coalgebra code
> in
> uses the following:

I use this in hashtables also :)
Gregory Collins <greg at>

More information about the Libraries mailing list