Name: pqueue Version: 1.0.0 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: Louis Wasserman Build-type: Simple cabal-version: >= 1.6 extra-source-files: include/Typeable.h source-repository head type: darcs location: http://code.haskell.org/containers-pqueue/ Library{ build-depends: base >= 4 && < 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 if impl(ghc) { extensions: DeriveDataTypeable } ghc-options: -fdicts-strict }