haskell-psqueue 1.1-11 source package in Ubuntu

Changelog

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

  [ Ilias Tsitsimpis ]
  * Change Priority to optional. Since Debian Policy version 4.0.1,
    priority extra has been deprecated.
  * Use the HTTPS form of the copyright-format URL
  * Modify d/watch and Source field in d/copyright to use HTTPS
  * Declare compliance with Debian policy 4.1.1
  * Use salsa.debian.org URLs in Vcs-{Browser,Git} fields

  [ Clint Adams ]
  * Bump to Standards-Version 4.1.4.

 -- Clint Adams <email address hidden>  Mon, 09 Apr 2018 20:05:01 -0400

Upload details

Uploaded by:
Debian Haskell Group on 2018-04-11
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-10-30 universe haskell
Cosmic release on 2018-06-27 universe haskell

Downloads

File Size SHA-256 Checksum
haskell-psqueue_1.1-11.dsc 2.4 KiB 25663ac67bccb785a9683e866fd7c9cf606b9b5a5e9a40b1b79bda276bef7822
haskell-psqueue_1.1.orig.tar.gz 6.1 KiB a8e0871ad10f916f55c3b9baec53eff23c4e97e09cf96d6c66771789e00a49cc
haskell-psqueue_1.1-11.debian.tar.xz 2.8 KiB f13acde157c96bdc17109ccc6361f6c4546a76f6381505b032af1ed28277f8ad

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.