depq 0.4.0.0 → 0.4.1.0
raw patch · 4 files changed
+10/−1 lines, 4 filesPVP ok
version bump matches the API change (PVP)
API changes (from Hackage documentation)
+ Data.DEPQ: instance Data.Foldable.Foldable (Data.DEPQ.DEPQ p)
Files
- ChangeLog.md +3/−0
- README.md +3/−0
- depq.cabal +1/−1
- src/Data/DEPQ.hs +3/−0
ChangeLog.md view
@@ -1,5 +1,8 @@ # Changelog for depq +## 0.4.1+* add Foldable instance+ ## 0.4 * Add test suite ( @HirotoShioi )
README.md view
@@ -1,5 +1,8 @@ # depq +[](https://hackage.haskell.org/package/depq)+[](http://stackage.org/nightly/package/depq)+ Double-ended priority queues This library provides a type for 'DEPQ's, along with functions for constructing and querying them.
depq.cabal view
@@ -1,5 +1,5 @@ name: depq-version: 0.4.0.0+version: 0.4.1.0 synopsis: Double-ended priority queues description: Double-ended priority queues, for efficient retrieval of minimum and maximum elements in ordered collections of items. homepage: https://github.com/ocramz/depq
src/Data/DEPQ.hs view
@@ -58,6 +58,9 @@ , maxHeap :: P.IntPSQ (Down p) a } deriving (Eq, Show) +instance Foldable (DEPQ p) where+ foldr f z (DEPQ mi _) = foldr f z mi+ instance (NFData p, NFData a) => NFData (DEPQ p a) where rnf (DEPQ mi ma) = rnf mi `seq` rnf ma