File: control

package info (click to toggle)
haskell-unordered-containers 0.2.9.0-2
  • links: PTS, VCS
  • area: main
  • in suites: buster, sid
  • size: 248 kB
  • sloc: haskell: 2,984; makefile: 3
file content (78 lines) | stat: -rw-r--r-- 2,822 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
69
70
71
72
73
74
75
76
77
78
Source: haskell-unordered-containers
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders: Clint Adams <clint@debian.org>
Priority: optional
Section: haskell
Rules-Requires-Root: no
Build-Depends: debhelper (>= 10),
 haskell-devscripts (>= 0.13),
 cdbs,
 ghc (>= 8),
 ghc-prof,
 libghc-hashable-dev (>= 1.0.1.1),
 libghc-hashable-dev (<< 1.3),
 libghc-hashable-prof,
 libghc-chasingbottoms-dev <!nocheck>,
 libghc-hunit-dev <!nocheck>,
 libghc-quickcheck2-dev (>= 2.4.0.1) <!nocheck>,
 libghc-test-framework-dev (>= 0.3.3) <!nocheck>,
 libghc-test-framework-hunit-dev <!nocheck>,
 libghc-test-framework-quickcheck2-dev (>= 0.2.9) <!nocheck>,
Build-Depends-Indep: ghc-doc,
 libghc-hashable-doc,
Standards-Version: 4.1.4
Homepage: https://github.com/tibbe/unordered-containers
Vcs-Browser: https://salsa.debian.org/haskell-team/DHG_packages/tree/master/p/haskell-unordered-containers
Vcs-Git: https://salsa.debian.org/haskell-team/DHG_packages.git [p/haskell-unordered-containers]

Package: libghc-unordered-containers-dev
Architecture: any
Depends: ${haskell:Depends},
 ${shlibs:Depends},
 ${misc:Depends},
Recommends: ${haskell:Recommends},
Suggests: ${haskell:Suggests},
Provides: ${haskell:Provides},
Description: Efficient hashing-based container types${haskell:ShortBlurb}
 It contains efficient hashing-based container types. The containers
 have been optimized for performance critical use, both in terms of
 large data quantities and high speed.
 .
 The declared cost of each operation is either worst-case or
 amortized, but remains valid even if structures are shared.
 .
 ${haskell:Blurb}

Package: libghc-unordered-containers-prof
Architecture: any
Depends: ${haskell:Depends},
 ${misc:Depends},
Recommends: ${haskell:Recommends},
Suggests: ${haskell:Suggests},
Provides: ${haskell:Provides},
Description: Efficient hashing-based container types${haskell:ShortBlurb}
 It contains efficient hashing-based container types. The containers
 have been optimized for performance critical use, both in terms of
 large data quantities and high speed.
 .
 The declared cost of each operation is either worst-case or
 amortized, but remains valid even if structures are shared.
 .
 ${haskell:Blurb}

Package: libghc-unordered-containers-doc
Architecture: all
Section: doc
Depends: ${misc:Depends},
 ${haskell:Depends},
Recommends: ${haskell:Recommends},
Suggests: ${haskell:Suggests},
Description: Efficient hashing-based container types${haskell:ShortBlurb}
 It contains efficient hashing-based container types. The containers
 have been optimized for performance critical use, both in terms of
 large data quantities and high speed.
 .
 The declared cost of each operation is either worst-case or
 amortized, but remains valid even if structures are shared.
 .
 ${haskell:Blurb}