homepage: ''
changelog-type: markdown
hash: 07b8e8141fbc6f6666a70389d8b8d6963d09cbd698f0740a079c835713c95c5f
test-bench-deps: {}
maintainer: Hackage Trustees <trustees@hackage.haskell.org>
synopsis: Priority Search Queue
changelog: |
  ### 1.1.0.1

  - Maintenance release
  - Add support for `base-4.11.0.0`
  - Fix link to ICFP paper
  - Modernise packaging
basic-deps:
  base: ! '>=4.3 && <4.14'
all-versions:
- '1.0'
- '1.1'
- 1.1.0.1
author: Ralf Hinze
latest: 1.1.0.1
description-type: haddock
description: |-
  A /priority search queue/ efficiently supports the
  opperations of both a search tree and a priority queue. A
  'Binding' is a product of a key and a priority.  Bindings
  can be inserted, deleted, modified and queried in
  logarithmic time, and the binding with the least priority
  can be retrieved in constant time.  A queue can be built
  from a list of bindings, sorted by keys, in linear time.
license-name: BSD-3-Clause

homepage: ''
changelog-type: markdown
hash: 498cd3d55e4644afbeaeb4d1df63392cd95826991465099395abb7d0c3ce3e58
test-bench-deps: {}
maintainer: Hackage Trustees <trustees@hackage.haskell.org>
synopsis: Priority Search Queue
changelog: |
  ### 1.1.0.1

  - Maintenance release
  - Add support for `base-4.11.0.0`
  - Fix link to ICFP paper
  - Modernise packaging
basic-deps:
  base: '>=4.3 && <4.15'
all-versions:
- '1.0'
- '1.1'
- 1.1.0.1
author: Ralf Hinze
latest: 1.1.0.1
description-type: haddock
description: |-
  A /priority search queue/ efficiently supports the
  opperations of both a search tree and a priority queue. A
  'Binding' is a product of a key and a priority.  Bindings
  can be inserted, deleted, modified and queried in
  logarithmic time, and the binding with the least priority
  can be retrieved in constant time.  A queue can be built
  from a list of bindings, sorted by keys, in linear time.
license-name: BSD-3-Clause

Update from Hackage at 2020-05-24T21:19:46Z
Update from Hackage at 2020-05-24T21:19:46Z
