Re: Faster IntSet by using BitMaps in the lower branches

On Sun, Sep 18, 2011 at 11:07 PM, Edward Kmett 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... uses the following:

I use this in hashtables also :) https://github.com/gregorycollins/hashtables/blob/master/src/Data/HashTable/... -- Gregory Collins