homepage: ''
changelog-type: ''
hash: 9741911a61035184134fbfde5e5723fb8363dc5d85a054bb50afe14bdc83bbac
test-bench-deps: {}
maintainer: ! 'Lennart Spitzner <lsp@informatik.uni-kiel.de>

  Louis Wasserman <wasserman.louis@gmail.com>'
synopsis: Reliable, persistent, fast priority queues.
changelog: ''
basic-deps:
  base: ! '>=4 && <4.9'
  deepseq: -any
all-versions:
- '1.0.0'
- '1.0.1'
- '1.1.0'
- '1.2.0'
- '1.2.1'
- '1.3.0'
author: Louis Wasserman
latest: '1.3.0'
description-type: haddock
description: A fast, reliable priority queue implementation based on a binomial heap.
license-name: BSD3

homepage: ''
changelog-type: ''
hash: 5570ee5782eb2ea829759a51d127ce01f250d857a0df7a2d6d3df14da5d67b2a
test-bench-deps: {}
maintainer: ! 'Lennart Spitzner <lsp@informatik.uni-kiel.de>

  Louis Wasserman <wasserman.louis@gmail.com>'
synopsis: Reliable, persistent, fast priority queues.
changelog: ''
basic-deps:
  base: ! '>=4 && <4.9'
  deepseq: -any
all-versions:
- '1.0.0'
- '1.0.1'
- '1.1.0'
- '1.2.0'
- '1.2.1'
- '1.3.0'
- '1.3.1'
author: Louis Wasserman
latest: '1.3.1'
description-type: haddock
description: A fast, reliable priority queue implementation based on a binomial heap.
license-name: BSD3

Update from Hackage at 2015-10-02T23:37:39+0000
Update from Hackage at 2015-10-02T23:37:39+0000
