"Advanced" Data Structures

Latest on Hackage:0.2

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow to host generated Haddocks.

BSD3 licensed by Edward A. Kmett
Maintained by Edward A. Kmett


Build Status

A playground for working with cache oblivious, succinct and compact data structures

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on

-Edward Kmett



  • Data.Vector.Map now has asymptotics that are fully deamortized.
  • Data.Vector.Map.Ephemeral provides a cache-oblivious lookahead array that doesn't deamortize. On the plus side it can be 2-4x faster than Data.Vector.Map. On the downside, using anything but the most recent version can dramaticlly affect the asymptotics of your program.


  • Repository initialized

comments powered byDisqus