name:           depq
version:        0.1.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
bug-reports:    https://github.com/ocramz/depq/issues
author:         Marco Zocca
maintainer:     ocramz
category:       Data, Data Structures, Data Mining
cabal-version:  >=1.10
tested-with:    GHC == 8.6.5
copyright:      2020 Marco Zocca
license:        BSD3
license-file:   LICENSE
build-type:     Simple
extra-source-files:
    README.md
    ChangeLog.md

source-repository head
  type: git
  location: https://github.com/ocramz/depq

library
  exposed-modules: Data.DEPQ
  hs-source-dirs:
      src
  build-depends:
      base >=4.7 && <5
    , containers
    , deepseq
    , psqueues
  default-language: Haskell2010



-- test-suite depq-test
--   type: exitcode-stdio-1.0
--   main-is: Spec.hs
--   other-modules:
--       Paths_depq
--   hs-source-dirs:
--       test
--   ghc-options: -threaded -rtsopts -with-rtsopts=-N
--   build-depends:
--       base >=4.7 && <5
--     , depq
--   default-language: Haskell2010