pqueue 1.3.2.2 → 1.3.2.3

raw patch · 2 files changed

+20/−5 lines, 2 filesdep ~base

Dependency ranges changed: base

Files

• CHANGELOG.md +4/−0
• pqueue.cabal +16/−5

@@ -1,5 +1,9 @@ # Revision history for pqueue +## 1.3.2.3  -- 2017-08-01++  * Maintenance release for ghc-8.2+ ## 1.3.2.2  -- 2017-03-12    * Add test-suite from darcs repository for pqueue-1.0.1.

@@ -1,5 +1,5 @@ Name:               pqueue-Version:            1.3.2.2+Version:            1.3.2.3 Category:           Data Structures Author:             Louis Wasserman License:            BSD3@@ -7,7 +7,7 @@ Stability:          experimental Synopsis:           Reliable, persistent, fast priority queues. Description:        A fast, reliable priority queue implementation based on a binomial heap.-Maintainer:         Lennart Spitzner <lsp@informatik.uni-kiel.de>+Maintainer:         Lennart Spitzner <hexagoxel@hexagoxel.de>                     Louis Wasserman <wasserman.louis@gmail.com> Bug-reports:        https://github.com/lspitzner/pqueue/issues Build-type:         Simple@@ -26,7 +26,7 @@   default-language:     Haskell2010   build-depends:-  { base >= 4 && < 4.10+  { base >= 4 && < 4.11   , deepseq >= 1.3 && < 1.5   }   exposed-modules:@@ -59,10 +59,12 @@ }  Test-Suite test+  default-language:+    Haskell2010   Type: exitcode-stdio-1.0   Main-Is: PQueueTests.hs   Build-Depends:-  { base >= 4 && < 4.10+  { base >= 4 && < 4.11   , deepseq >= 1.3 && < 1.5   , QuickCheck >=2.5 && <3   }@@ -78,4 +80,13 @@     }   }   If impl(ghc)-    Extensions: DeriveDataTypeable+    default-extensions: DeriveDataTypeable+  other-modules:+    Data.PQueue.Prio.Internals+    Data.PQueue.Internals+    Data.PQueue.Prio.Max.Internals+    Control.Applicative.Identity+    Data.PQueue.Prio.Min+    Data.PQueue.Prio.Max+    Data.PQueue.Min+    Data.PQueue.Max