Faster IntSet by using BitMaps in the lower branches

[Gregory Collins]

On Sun, Sep 18, 2011 at 11:07 PM, Edward Kmett <ekmett at gmail.com> 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 https://github.com/ekmett/algebra/blob/master/Numeric/Coalgebra/Geometric.hs#L72
> uses the following:

I use this in hashtables also :)

https://github.com/gregorycollins/hashtables/blob/master/src/Data/HashTable/Internal/CacheLine.hs#L273
-- 
Gregory Collins <greg at gregorycollins.net>