| 1 |
Source: haskell-psqueue |
| 2 |
Maintainer: Debian Haskell Group <[email protected]> |
| 3 |
Uploaders: Kiwamu Okabe <[email protected]> |
| 4 |
Priority: optional |
| 5 |
Section: haskell |
| 6 |
Rules-Requires-Root: no |
| 7 |
Build-Depends: |
| 8 |
dh-sequence-haskell, |
| 9 |
debhelper-compat (= 13), |
| 10 |
ghc (>= 9.6), |
| 11 |
ghc-prof, |
| 12 |
haskell-devscripts (>= 0.13), |
| 13 |
Build-Depends-Indep: ghc-doc |
| 14 |
Standards-Version: 4.7.0 |
| 15 |
Homepage: https://hackage.haskell.org/package/PSQueue |
| 16 |
Vcs-Browser: https://salsa.debian.org/haskell-team/DHG_packages/tree/master/p/haskell-psqueue |
| 17 |
Vcs-Git: https://salsa.debian.org/haskell-team/DHG_packages.git [p/haskell-psqueue] |
| 18 |
|
| 19 |
Package: libghc-psqueue-dev |
| 20 |
Architecture: any |
| 21 |
Depends: ${haskell:Depends}, ${misc:Depends}, ${shlibs:Depends} |
| 22 |
Recommends: ${haskell:Recommends} |
| 23 |
Suggests: ${haskell:Suggests} |
| 24 |
Provides: ${haskell:Provides} |
| 25 |
Description: Priority Search Queue |
| 26 |
A /priority search queue/ efficiently supports the |
| 27 |
opperations of both a search tree and a priority queue. A |
| 28 |
'Binding' is a product of a key and a priority. Bindings |
| 29 |
can be inserted, deleted, modified and queried in |
| 30 |
logarithmic time, and the binding with the least priority |
| 31 |
can be retrieved in constant time. A queue can be built |
| 32 |
from a list of bindings, sorted by keys, in linear time. |
| 33 |
. |
| 34 |
This package contains the normal library files. |
| 35 |
|
| 36 |
Package: libghc-psqueue-prof |
| 37 |
Architecture: any |
| 38 |
Depends: ${haskell:Depends}, ${misc:Depends} |
| 39 |
Recommends: ${haskell:Recommends} |
| 40 |
Suggests: ${haskell:Suggests} |
| 41 |
Provides: ${haskell:Provides} |
| 42 |
Description: Priority Search Queue; profiling libraries |
| 43 |
A /priority search queue/ efficiently supports the |
| 44 |
opperations of both a search tree and a priority queue. A |
| 45 |
'Binding' is a product of a key and a priority. Bindings |
| 46 |
can be inserted, deleted, modified and queried in |
| 47 |
logarithmic time, and the binding with the least priority |
| 48 |
can be retrieved in constant time. A queue can be built |
| 49 |
from a list of bindings, sorted by keys, in linear time. |
| 50 |
. |
| 51 |
This package contains the libraries compiled with profiling enabled. |
| 52 |
|
| 53 |
Package: libghc-psqueue-doc |
| 54 |
Architecture: all |
| 55 |
Section: doc |
| 56 |
Depends: ${haskell:Depends}, ${misc:Depends} |
| 57 |
Recommends: ${haskell:Recommends} |
| 58 |
Suggests: ${haskell:Suggests} |
| 59 |
Description: Priority Search Queue; documentation |
| 60 |
A /priority search queue/ efficiently supports the |
| 61 |
opperations of both a search tree and a priority queue. A |
| 62 |
'Binding' is a product of a key and a priority. Bindings |
| 63 |
can be inserted, deleted, modified and queried in |
| 64 |
logarithmic time, and the binding with the least priority |
| 65 |
can be retrieved in constant time. A queue can be built |
| 66 |
from a list of bindings, sorted by keys, in linear time. |
| 67 |
. |
| 68 |
This package contains the documentation files. |