haskell-psqueue 1.2.0-1build1 source package in Ubuntu
Changelog
haskell-psqueue (1.2.0-1build1) oracular; urgency=medium * Rebuild against new GHC ABIs. -- Gianfranco Costamagna <email address hidden> Wed, 15 May 2024 10:34:26 +0200
Upload details
- Uploaded by:
- Gianfranco Costamagna
- Uploaded to:
- Oracular
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | haskell |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-psqueue_1.2.0.orig.tar.gz | 7.1 KiB | 39003847be7f302a7059b4e103739677f3b205f2d41e63557acc40f9cc577be6 |
| haskell-psqueue_1.2.0-1build1.debian.tar.xz | 3.2 KiB | 304deb22c482155db0295a08468d3a507f09ba9d4e7fd93a15bb6f139d7471ab |
| haskell-psqueue_1.2.0-1build1.dsc | 2.2 KiB | 5c11bf3ad96fef96d4f777b457415bc631fae91aa18b05051afaa0fbd04f9171 |
Available diffs
- diff from 1.2.0-1 (in Debian) to 1.2.0-1build1 (353 bytes)
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.
