haskell-psqueue 1.1-4 source package in Ubuntu
Changelog
haskell-psqueue (1.1-4) unstable; urgency=low * Enable compat level 9 -- Joachim Breitner <email address hidden> Fri, 24 May 2013 12:51:45 +0200
Upload details
- Uploaded by:
- Debian Haskell Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Trusty | release | universe | haskell |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-psqueue_1.1-4.dsc | 1.5 KiB | f8d5de83596384ef7a9968718ef1c4b64744f73b94105144145879f5f49b9157 |
| haskell-psqueue_1.1.orig.tar.gz | 6.1 KiB | a8e0871ad10f916f55c3b9baec53eff23c4e97e09cf96d6c66771789e00a49cc |
| haskell-psqueue_1.1-4.debian.tar.gz | 2.2 KiB | 780cc5b854ebca09d605f554cce3a96b00a306b8647fad1708a1c6d5818a35fb |
Available diffs
- diff from 1.1-3 to 1.1-4 (585 bytes)
No changes file available.
Binary packages built by this source
- libghc-psqueue-dev: No summary available for libghc-psqueue-dev in ubuntu wily.
No description available for libghc-psqueue-dev in ubuntu wily.
- 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.
