Hello haskell-cafe, I'm pleased to announce a rewrite of the heap package, heap-1.0.0 [1]. It is not 100% compatible to the version 0.6.0, but provides major improvements: - The HeapPolicy type class hack used to distinguish between min- max-, min-prio- and max-prio-heaps has been replaced by the HeapItem type family (the type family provides functions to convert insertable 'items' to (priority, value) pairs and back. Thus a static min-heap (HeapT) can be used as underlying implementation, but the package can still provide MinHeap, MaxHeap, MinPrioHeap and MaxPrioHeap. - A nice side effect of the above is, that ({Min,Max}PrioHeap p) now is an instance of Functor - Faster {from,to}{Asc,Desc}List conversions - A binary with quickcheck test cases can now be built from cabal (with a "Test" flag) (the old versions already had lots of test cases, but cabal didn't know about them). Regards, Stephan [1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/heap-1.0.0 -- Früher hieß es ja: Ich denke, also bin ich. Heute weiß man: Es geht auch so. - Dieter Nuhr