[commit: containers] master: Re-implement IntSet by packing adjacent 32 or 64 entries (37e38bb)

[Ian Lynagh]

Repository : ssh://darcs.haskell.org//srv/darcs/packages/containers

On branch  : master

http://hackage.haskell.org/trac/ghc/changeset/37e38bba42b64b377bcc93f8bf8bd88f528aba33

>---------------------------------------------------------------

commit 37e38bba42b64b377bcc93f8bf8bd88f528aba33
Author: Joachim Breitner <mail at joachim-breitner.de>
Date:   Sat Sep 17 22:06:42 2011 +0200

    Re-implement IntSet by packing adjacent 32 or 64 entries
    
    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.

 Data/{IntSet.hs => DenseIntSet.hs} |  396 +++++++++++++++++++++++-------------
 1 files changed, 257 insertions(+), 139 deletions(-)


Diff suppressed because of size. To see it, use:

    git show 37e38bba42b64b377bcc93f8bf8bd88f528aba33