GitHub - gereeter/bounded-intmap: A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.The most current work on this is being done in haskell/containers#340. This repository is not obsolete because it is still the best description of the algorithm, but it is unmaintained. bounded-intmap is a reimplementation of Data.IntMap that uses minimum and maximum bounds on subtrees instread of bit prefixes. The original idea, by Edward Kmett, is described here. As per my current benchmark resu
