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
79
|
Source: haskell-unordered-containers
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders: Clint Adams <clint@debian.org>
Priority: extra
Section: haskell
Build-Depends: debhelper (>= 9),
cdbs,
haskell-devscripts (>= 0.9),
ghc,
ghc-prof,
libghc-hashable-dev (>> 1.0.1.1),
libghc-hashable-prof,
libghc-hashmap-dev,
libghc-hashmap-prof,
libghc-quickcheck2-dev (>> 2.4.0.1),
libghc-hunit-dev,
libghc-chasingbottoms-dev,
libghc-test-framework-dev (>> 0.3.3),
libghc-test-framework-quickcheck2-dev (>> 0.2.9),
libghc-test-framework-hunit-dev,
Build-Depends-Indep: ghc-doc,
libghc-hashable-doc,
libghc-hashmap-doc,
Standards-Version: 3.9.4
Homepage: http://hackage.haskell.org/package/unordered-containers
Vcs-Browser: http://darcs.debian.org/cgi-bin/darcsweb.cgi?r=pkg-haskell/haskell-unordered-containers
Vcs-Darcs: http://darcs.debian.org/pkg-haskell/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}
|
