Cabal revisions of pqueue-1.4.1.2
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-Name: pqueue-Version: 1.4.1.2-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 <hexagoxel@hexagoxel.de>- Louis Wasserman <wasserman.louis@gmail.com>-Bug-reports: https://github.com/lspitzner/pqueue/issues-Build-type: Simple-cabal-version: >= 1.10-tested-with: GHC == 7.10.3, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.3, GHC == 8.6.1-extra-source-files: {- include/Typeable.h- CHANGELOG.md-}--source-repository head- type: git- location: git@github.com:lspitzner/pqueue.git--Library {- default-language:- Haskell2010- build-depends:- { base >= 4.8 && < 4.13- , 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) {- default-extensions: DeriveDataTypeable- }- ghc-options: {- -fdicts-strict- -Wall- -fno-warn-inline-rule-shadowing- }- if impl(ghc>=7.10) {- ghc-options: {- -fno-warn-unused-imports- }- }-}--Test-Suite test- default-language:- Haskell2010- Type: exitcode-stdio-1.0- Main-Is: PQueueTests.hs- Build-Depends:- { base >= 4.8 && < 4.13- , deepseq >= 1.3 && < 1.5- , QuickCheck >=2.5 && <3- }- ghc-options: {- -Wall- -fno-warn-inline-rule-shadowing- }- if impl(ghc>=7.10) {- ghc-options: {- -fno-warn-unused-imports- }- }- If impl(ghc)- 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+Name: pqueue +Version: 1.4.1.2 +x-revision: 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 <hexagoxel@hexagoxel.de> + Louis Wasserman <wasserman.louis@gmail.com> +Bug-reports: https://github.com/lspitzner/pqueue/issues +Build-type: Simple +cabal-version: >= 1.10 +tested-with: GHC == 7.10.3, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.3, GHC == 8.6.1 +extra-source-files: { + include/Typeable.h + CHANGELOG.md +} + +source-repository head + type: git + location: git@github.com:lspitzner/pqueue.git + +Library { + default-language: + Haskell2010 + build-depends: + { base >= 4.8 && < 4.14 + , 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) { + default-extensions: DeriveDataTypeable + } + ghc-options: { + -fdicts-strict + -Wall + -fno-warn-inline-rule-shadowing + } + if impl(ghc>=7.10) { + ghc-options: { + -fno-warn-unused-imports + } + } +} + +Test-Suite test + default-language: + Haskell2010 + Type: exitcode-stdio-1.0 + Main-Is: PQueueTests.hs + Build-Depends: + { base >= 4.8 && < 4.14 + , deepseq >= 1.3 && < 1.5 + , QuickCheck >=2.5 && <3 + } + ghc-options: { + -Wall + -fno-warn-inline-rule-shadowing + } + if impl(ghc>=7.10) { + ghc-options: { + -fno-warn-unused-imports + } + } + If impl(ghc) + 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