homepage: https://github.com/ocramz/depq
changelog-type: markdown
hash: 4da17ea1b8e4d48be13532de51a4d751124c082130d3cfee5e2cb1c23aede6f8
test-bench-deps: {}
maintainer: ocramz
synopsis: Double-ended priority queues
changelog: |
  # Changelog for depq

  ## 0.1
  First release
basic-deps:
  base: '>=4.7 && <5'
  containers: -any
  deepseq: -any
  psqueues: -any
all-versions:
- 0.1.0.0
author: Marco Zocca
latest: 0.1.0.0
description-type: markdown
description: |
  # depq
license-name: BSD-3-Clause

homepage: https://github.com/ocramz/depq
changelog-type: markdown
hash: de39c1fb07aafb9a62f96ca86438739479dde160a719f9904d356b9cd55c124e
test-bench-deps: {}
maintainer: ocramz
synopsis: Double-ended priority queues
changelog: |
  # Changelog for depq

  ## 0.1
  First release
basic-deps:
  base: '>=4.7 && <5'
  containers: '>=0.6.0.1'
  deepseq: '>=1.4.4'
  psqueues: '>=0.2.7.2'
all-versions:
- 0.1.0.0
- 0.2.0.0
author: Marco Zocca
latest: 0.2.0.0
description-type: markdown
description: "# depq\n\nDouble-ended priority queues\n\nThis library provides a type
  for 'DEPQ's, along with functions for constructing and querying them. \n\n## Usage\n\nThe
  'Data.DEPQ' module exports the user interface, which is similar to that of most
  Haskell data container libraries.\n\nThe most common use case of this library is
  to populate a DEPQ (either from a 'Foldable' collection or by 'insert'ing incrementally)
  and query either or both of its extremes (with 'findMin', 'findMax', 'popMin', 'popMax',
  'topK', 'bottomK').\n\nHave fun!\n\n## Implementation \n\nCurrently the implementation
  is based on 'IntPSQ' (integer-indexed priority search queues) from the 'psqueues'
  package.\n\n"
license-name: BSD-3-Clause

Update from Hackage at 2020-05-23T07:36:27Z
Update from Hackage at 2020-05-23T07:36:27Z
