haskell-psqueue 1.1-8 source package in Ubuntu
Changelog
haskell-psqueue (1.1-8) unstable; urgency=medium * Switch Vcs-Git/Vcs-Browser headers to new location. -- Clint Adams <email address hidden> Thu, 03 Dec 2015 14:54:57 -0500
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 | Published | Component | Section | |
---|---|---|---|---|
Xenial | release | universe | haskell |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
haskell-psqueue_1.1-8.dsc | 2.3 KiB | 5f37c0e81679b96fd5a2175490d6a1e3d91c39fbf44b14ababa88ff37add26a2 |
haskell-psqueue_1.1-8.debian.tar.xz | 2.4 KiB | 7ff46e9437c84fe9c47089a536dfd0658cabc2371e7292b9f71a66812754f889 |
haskell-psqueue_1.1.orig.tar.gz | 6.1 KiB | a8e0871ad10f916f55c3b9baec53eff23c4e97e09cf96d6c66771789e00a49cc |
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.