This is the dense int set implementation as discussed on library #3

Closed
wants to merge 18 commits into
from
Commits on Sep 17, 2011
  1. Re-implement IntSet by packing adjacent 32 or 64 entries

    nomeata committed Sep 17, 2011
    This causes an enourmous speed up for union and intersection, some
    speedup for insertion, similar performance for findMin/Max and much
    reduced memory consumption for dense sets.
  2. setBit 0 == bit

    nomeata committed Sep 17, 2011
Commits on Sep 18, 2011
  1. bitcount source reference

    nomeata committed Sep 18, 2011
  2. More benchmarking tools

    nomeata committed Sep 18, 2011
Commits on Sep 19, 2011
  1. Comparision code improvements

    nomeata committed Sep 19, 2011
Commits on Sep 20, 2011
  1. Comments and other cleanup

    nomeata committed Sep 20, 2011
  2. Make DenseIntSet ready for release

    nomeata committed Sep 20, 2011
    By turning it into IntSet, overriding the existing implementation.
Commits on Sep 21, 2011
  1. Implement list fusion for {Int,}{MapSet}

    nomeata committed Sep 21, 2011
    I am not fully convinced that it works well with the INLINEABLE pragmas,
    but it won’t do harm this way either.
  2. Merge branch 'denseintmap' into denseintmap-integration

    nomeata committed Sep 21, 2011
    Conflicts:
    	Data/DenseIntSet.hs