Faster IntSet by using BitMaps in the lower branches

[Joachim Breitner]

Hi,

Am Samstag, den 17.09.2011, 23:37 +0200 schrieb Milan Straka:
> When you are happy with the code, could you please send a pull request
> on the github containers repo? I (and/or Johan, if he wants) will look
> at the code. Of course, having good comments and test coverage would be
> a great help. I am quite busy till Sun 25, but have some time after that. 

I shaped the code into something that I am happy with so far. I have
greatly extended the test suite, so that it covers every non-trivial
non-debugging function, and indeed I found and fixed some bugs in split.

https://github.com/haskell/containers/pull/3

The git commit history might not be as clean as it could be using rebase
-i, but I think it is still worth having it in the repo as it allows one
to later jump to, e.g. 4f4ca91, where both IntSet and DenseIntSet and my
benchmarking scrips are available.

Greetings,
Joachim

-- 
Joachim "nomeata" Breitner
  mail at joachim-breitner.de  |  nomeata at debian.org  |  GPG: 0x4743206C
  xmpp: nomeata at joachim-breitner.de | http://www.joachim-breitner.de/

-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 198 bytes
Desc: This is a digitally signed message part
URL: <http://www.haskell.org/pipermail/libraries/attachments/20110920/fb74d512/attachment.pgp>