Sat 15 May 2010
Brodal-Okasaki Heaps in Haskell
Posted by Edward Kmett under Algorithms , Data Structures , Haskell , MonoidsComments Off
I've uploaded a package named heaps to Hackage that provides Brodal-Okasaki bootstrapped skew-binomial heaps in Haskell.
The main features of the library are that it provides a nice containers-like API with provably asymptotically optimal functional heap operations including O(1) insert and O(1) union, and that the library design jump through a number of hoops to provide implementations of common Haskell typeclasses such as Foldable, Data and Typeable.