Ubuntu
haskell-psqueue package

haskell-psqueue 1.2.0-1 source package in Ubuntu

Changelog

haskell-psqueue (1.2.0-1) unstable; urgency=medium

  * Declare compliance with Debian policy 4.6.2
  * New upstream release

 -- Ilias Tsitsimpis <email address hidden>  Mon, 28 Aug 2023 18:21:47 +0300

Upload details

Uploaded by:
Debian Haskell Group
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
Oracular release universe haskell
Noble release universe haskell

Downloads

File Size SHA-256 Checksum
haskell-psqueue_1.2.0-1.dsc 2.2 KiB 50554e792cc786be140a047f61c11514fefcc29a8e1f16d609a110b833b78788
haskell-psqueue_1.2.0.orig.tar.gz 7.1 KiB 39003847be7f302a7059b4e103739677f3b205f2d41e63557acc40f9cc577be6
haskell-psqueue_1.2.0-1.debian.tar.xz 3.2 KiB 98b0f3fa13ecaacb8f1ebc70f2414c8543efd8ce5e183fb8ae357e94f1ab12d0

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.