structures

This package is a playground for working with several types of advanced data structures including wavelet trees and cache oblivious lookahead arrays.


Keywords
benchmark, bsd3, data, library, structures, Propose Tags , Data.Vector.Array, Data.Vector.Bit, Data.Vector.Bloom, Data.Vector.Bloom.Mutable, Data.Vector.Bloom.Util, Data.Vector.Heap, Data.Vector.Map, Data.Vector.Map.Deamortized, Data.Vector.Map.Ephemeral, Data.Vector.Map.Fusion, Data.Vector.Set, Data.Vector.Set.Fusion, Data.Vector.Slow
License
BSD-3-Clause
Install
cabal install structures-0.2

Documentation

structures

Hackage 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 irc.freenode.net.

-Edward Kmett