homepage: ''
changelog-type: ''
hash: b1e1e9e15296602c432a12ccc036b423850c3c6749eb0956441c583502d74ab0
test-bench-deps: {}
maintainer: Scott E. Dillard <sedillard@gmail.com>
synopsis: Priority Search Queue
changelog: ''
basic-deps:
  base: -any
all-versions:
- '1.0'
- '1.1'
author: Ralf Hinze
latest: '1.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: BSD3

homepage: ''
changelog-type: ''
hash: 188b45e7cca61d59df13a0a24eaa259b54eaedbafc639bef519e5f38d718fd3e
test-bench-deps: {}
maintainer: Scott E. Dillard <sedillard@gmail.com>
synopsis: Priority Search Queue
changelog: ''
basic-deps:
  base: ! '>=4 && <4.11'
all-versions:
- '1.0'
- '1.1'
author: Ralf Hinze
latest: '1.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: BSD3

Update from Hackage at 2018-03-31T13:38:44Z
Update from Hackage at 2018-03-31T13:38:44Z
