BSD3 licensed by Stephan Friedrichs
Maintained by Manuel Eberl (last name + m _at_

Module documentation for 1.0.3

A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.


Latest version: 1.0.2

1.0.1 --> 1.0.2
- updated imports for GHC 7.10 (thanks to Michael Baikov for the patch)

1.0.0 --> 1.0.1
- set Data.Heap.Item to Trustworthy to enable usage of Data.Heap in Safe Haskell (trustworthy is required due to rewrite rules)
- changed the INLINE pragma for splitF to INLINE[1] (GHC warned about the rule possible not firing)
- fixed QuickCheck tests to work with QuickCheck > 2.2
comments powered byDisqus