depq 0.1.0.0 → 0.2.0.0

raw patch · 2 files changed

+21/−4 lines, 2 filesdep ~containersdep ~deepseqdep ~psqueuesPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: containers, deepseq, psqueues

API changes (from Hackage documentation)

Files

• README.md +17/−0
• depq.cabal +4/−4

@@ -1,1 +1,18 @@ # depq++Double-ended priority queues++This library provides a type for 'DEPQ's, along with functions for constructing and querying them. ++## Usage++The 'Data.DEPQ' module exports the user interface, which is similar to that of most Haskell data container libraries.++The most common use case of this library is to populate a DEPQ (either from a 'Foldable' collection or by 'insert'ing incrementally) and query either or both of its extremes (with 'findMin', 'findMax', 'popMin', 'popMax', 'topK', 'bottomK').++Have fun!++## Implementation ++Currently the implementation is based on 'IntPSQ' (integer-indexed priority search queues) from the 'psqueues' package.+

@@ -1,5 +1,5 @@ name:           depq-version:        0.1.0.0+version:        0.2.0.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@@ -27,9 +27,9 @@       src   build-depends:       base >=4.7 && <5-    , containers-    , deepseq-    , psqueues+    , containers >= 0.6.0.1+    , deepseq >= 1.4.4+    , psqueues >= 0.2.7.2   default-language: Haskell2010