File: control

package info (click to toggle)
haskell-psqueue 1.1-13
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, sid
  • size: 104 kB
  • sloc: haskell: 360; makefile: 2
file content (68 lines) | stat: -rw-r--r-- 2,661 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
Source: haskell-psqueue
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders: Kiwamu Okabe <kiwamu@debian.or.jp>
Priority: optional
Section: haskell
Rules-Requires-Root: no
Build-Depends:
 cdbs,
 debhelper (>= 10),
 ghc (>= 8),
 ghc-prof,
 haskell-devscripts (>= 0.13),
Build-Depends-Indep: ghc-doc
Standards-Version: 4.1.4
Homepage: http://hackage.haskell.org/package/PSQueue
Vcs-Browser: https://salsa.debian.org/haskell-team/DHG_packages/tree/master/p/haskell-psqueue
Vcs-Git: https://salsa.debian.org/haskell-team/DHG_packages.git [p/haskell-psqueue]

Package: libghc-psqueue-dev
Architecture: any
Depends: ${haskell:Depends}, ${misc:Depends}, ${shlibs:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: 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.

Package: libghc-psqueue-prof
Architecture: any
Depends: ${haskell:Depends}, ${misc:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: 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.

Package: libghc-psqueue-doc
Architecture: all
Section: doc
Depends: ${haskell:Depends}, ${misc:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Description: 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.