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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
Source: haskell-hashmap
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders:
Clint Adams <clint@debian.org>,
Priority: extra
Section: haskell
Build-Depends:
cdbs,
debhelper (>= 9),
ghc (>= 8),
ghc-prof,
haskell-devscripts (>= 0.13),
libghc-hashable-dev (>= 1.0),
libghc-hashable-prof,
Build-Depends-Indep:
ghc-doc,
libghc-hashable-doc,
Standards-Version: 3.9.8
Homepage: http://git.auryn.cz/haskell/hashmap/
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-haskell/DHG_packages.git/tree/p/haskell-hashmap
Vcs-Git: https://anonscm.debian.org/cgit/pkg-haskell/DHG_packages.git
Package: libghc-hashmap-dev
Architecture: any
Depends:
${haskell:Depends},
${misc:Depends},
${shlibs:Depends},
Recommends:
${haskell:Recommends},
Suggests:
${haskell:Suggests},
Provides:
${haskell:Provides},
Description: persistent containers Map and Set based on hashing${haskell:ShortBlurb}
An implementation of persistent Map and Set containers based on hashing.
The implementation is build on top of Data.IntMap.IntMap and
Data.IntSet.IntSet, with very similar API. It uses Hashable class from the
hashable package for hashing.
.
This package can be used as a drop-in replacement for Data.Map and Data.Set
modules.
.
The Map key value is an Data.IntMap.IntMap indexed by the hash value,
containing either one (key, value) or a Data.Map.Map key value for all
keys with the same hash value.
.
The Set elem is an Data.IntMap.IntMap indexed by the hash value, containing
either one elem or Data.Set.Set elem for all elements with the same hash
value.
.
${haskell:Blurb}
Package: libghc-hashmap-prof
Architecture: any
Depends:
${haskell:Depends},
${misc:Depends},
Recommends:
${haskell:Recommends},
Suggests:
${haskell:Suggests},
Provides:
${haskell:Provides},
Description: persistent containers Map and Set based on hashing${haskell:ShortBlurb}
An implementation of persistent Map and Set containers based on hashing.
The implementation is build on top of Data.IntMap.IntMap and
Data.IntSet.IntSet, with very similar API. It uses Hashable class from the
hashable package for hashing.
.
This package can be used as a drop-in replacement for Data.Map and Data.Set
modules.
.
The Map key value is an Data.IntMap.IntMap indexed by the hash value,
containing either one (key, value) or a Data.Map.Map key value for all
keys with the same hash value.
.
The Set elem is an Data.IntMap.IntMap indexed by the hash value, containing
either one elem or Data.Set.Set elem for all elements with the same hash
value.
.
${haskell:Blurb}
Package: libghc-hashmap-doc
Architecture: all
Section: doc
Depends:
${haskell:Depends},
${misc:Depends},
Recommends:
${haskell:Recommends},
Suggests:
${haskell:Suggests},
Description: persistent containers Map and Set based on hashing${haskell:ShortBlurb}
An implementation of persistent Map and Set containers based on hashing.
The implementation is build on top of Data.IntMap.IntMap and
Data.IntSet.IntSet, with very similar API. It uses Hashable class from the
hashable package for hashing.
.
This package can be used as a drop-in replacement for Data.Map and Data.Set
modules.
.
The Map key value is an Data.IntMap.IntMap indexed by the hash value,
containing either one (key, value) or a Data.Map.Map key value for all
keys with the same hash value.
.
The Set elem is an Data.IntMap.IntMap indexed by the hash value, containing
either one elem or Data.Set.Set elem for all elements with the same hash
value.
.
${haskell:Blurb}
|
