haskell-psqueue 1.1.1-1build1 source package in Ubuntu
Changelog
haskell-psqueue (1.1.1-1build1) lunar; urgency=medium * Rebuild against new OCAML ABI. -- Gianfranco Costamagna <email address hidden> Thu, 08 Dec 2022 21:46:24 +0100
Upload details
- Uploaded by:
- Gianfranco Costamagna
- Uploaded to:
- Lunar
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-psqueue_1.1.1.orig.tar.gz | 6.7 KiB | 7191ef25e63df3658ad3eccde7d7a7e31fa8dd43c6705714672836dbf9c7ef0a |
| haskell-psqueue_1.1.1-1build1.debian.tar.xz | 3.2 KiB | b2a2598f910ac31ce7cc1171e884bf3cc44153197d5397bfb069fbac99987138 |
| haskell-psqueue_1.1.1-1build1.dsc | 2.2 KiB | 13ec4fddab47ad416dd7f196e7c080955a0439b6e4649b4264a7fc873ea388ed |
Available diffs
- diff from 1.1.1-1 (in Debian) to 1.1.1-1build1 (333 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.
