haskell-psqueue 1.1-13 source package in Ubuntu

Changelog

haskell-psqueue (1.1-13) unstable; urgency=medium

  * Patch to build with newer ghc

 -- Ilias Tsitsimpis <email address hidden>  Wed, 03 Oct 2018 14:13:06 +0300

Upload details

Uploaded by:
Debian Haskell Group on 2018-10-03
Uploaded to:
Sid
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Disco release on 2018-12-20 universe haskell

Downloads

File Size SHA-256 Checksum
haskell-psqueue_1.1-13.dsc 2.2 KiB 2c8d5eec2bf1f6921e588bfd3ccff38bca039190de5030fdb3421f230a2e3480
haskell-psqueue_1.1.orig.tar.gz 6.1 KiB a8e0871ad10f916f55c3b9baec53eff23c4e97e09cf96d6c66771789e00a49cc
haskell-psqueue_1.1-13.debian.tar.xz 3.1 KiB 31f3ed14d4136773b192e48af723063173d662894ac1d779461849dda9796870

Available diffs

No changes file available.

Binary packages built by this source

libghc-psqueue-dev: Priority Search Queue

 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.
 .
 This package contains the normal library files.

libghc-psqueue-doc: Priority Search Queue; documentation

 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.
 .
 This package contains the documentation files.

libghc-psqueue-prof: Priority Search Queue; profiling libraries

 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.
 .
 This package contains the libraries compiled with profiling enabled.