Name: pqueue Version: 1.3.2.1 Category: Data Structures Author: Louis Wasserman License: BSD3 License-file: LICENSE Stability: experimental Synopsis: Reliable, persistent, fast priority queues. Description: A fast, reliable priority queue implementation based on a binomial heap. Maintainer: Lennart Spitzner Louis Wasserman Bug-reports: https://github.com/lspitzner/pqueue/issues Build-type: Simple cabal-version: >= 1.6 tested-with: GHC == 7.0.4, GHC == 7.2.2, GHC == 7.6.3, GHC == 7.8.4, GHC == 7.10.1, GHC == 8.0.1 extra-source-files: { include/Typeable.h CHANGELOG.md } source-repository head type: git location: git@github.com:lspitzner/pqueue.git Library { build-depends: { base >= 4 && < 4.10 , deepseq >= 1.3 && < 1.5 } exposed-modules: Data.PQueue.Prio.Min Data.PQueue.Prio.Max Data.PQueue.Min Data.PQueue.Max other-modules: Data.PQueue.Prio.Internals Data.PQueue.Internals Data.PQueue.Prio.Max.Internals Control.Applicative.Identity if impl(ghc) { extensions: DeriveDataTypeable } ghc-options: { -fdicts-strict -Wall } if impl(ghc>=7.8) { ghc-options: { -fno-warn-inline-rule-shadowing } } }