Debian Codegraph @

debian/control

raw
1 Source: haskell-hashtables
2 Maintainer: Debian Haskell Group <[email protected]>
3 Uploaders:
4 Iain Lane <[email protected]>,
5 Priority: optional
6 Section: haskell
7 Rules-Requires-Root: no
8 Build-Depends:
9 dh-sequence-haskell,
10 debhelper-compat (= 13),
11 ghc (>= 9.4),
12 ghc-prof,
13 haskell-devscripts (>= 0.13),
14 libghc-hashable-dev (>= 1.4),
15 libghc-hashable-dev (<< 1.6),
16 libghc-hashable-prof,
17 libghc-primitive-dev,
18 libghc-primitive-prof,
19 libghc-vector-dev (>= 0.7),
20 libghc-vector-dev (<< 0.14),
21 libghc-vector-prof,
22 Build-Depends-Indep:
23 ghc-doc,
24 libghc-hashable-doc,
25 libghc-primitive-doc,
26 libghc-vector-doc,
27 Standards-Version: 4.7.3
28 Homepage: https://github.com/gregorycollins/hashtables
29 Vcs-Browser: https://salsa.debian.org/haskell-team/DHG_packages/tree/master/p/haskell-hashtables
30 Vcs-Git: https://salsa.debian.org/haskell-team/DHG_packages.git [p/haskell-hashtables]
31
32 Package: libghc-hashtables-dev
33 Architecture: any
34 Depends:
35 ${haskell:Depends},
36 ${misc:Depends},
37 ${shlibs:Depends},
38 Recommends:
39 ${haskell:Recommends},
40 Suggests:
41 ${haskell:Suggests},
42 Provides:
43 ${haskell:Provides},
44 Description: mutable hash tables${haskell:ShortBlurb}
45 This package provides a couple of different implementations of mutable hash
46 tables in the ST monad, as well as a typeclass abstracting their common
47 operations, and a set of wrappers to use the hash tables in the IO monad.
48 .
49 There are three hash table implementations:
50 .
51 * Data.HashTable.ST.Basic contains a basic open-addressing hash table using
52 linear probing as the collision strategy. This should currently be the
53 fastest available hash table implementation for lookups, although it has a
54 higher memory overhead than others.
55 * Data.HashTable.ST.Cuckoo contains an implementation of "cuckoo hashing".
56 Cuckoo hashing has worst-case O(1) lookups and performs well even when the
57 table is highly loaded.
58 * Data.HashTable.ST.Linear contains a linear hash table, which trades some
59 insert and lookup performance for higher space efficiency and much shorter
60 delays when expanding the table.
61 .
62 ${haskell:Blurb}
63
64 Package: libghc-hashtables-prof
65 Architecture: any
66 Depends:
67 ${haskell:Depends},
68 ${misc:Depends},
69 ${shlibs:Depends},
70 Recommends:
71 ${haskell:Recommends},
72 Suggests:
73 ${haskell:Suggests},
74 Provides:
75 ${haskell:Provides},
76 Description: mutable hash tables -- profiling libraries${haskell:ShortBlurb}
77 This package provides a couple of different implementations of mutable hash
78 tables in the ST monad, as well as a typeclass abstracting their common
79 operations, and a set of wrappers to use the hash tables in the IO monad.
80 .
81 There are three hash table implementations:
82 .
83 * Data.HashTable.ST.Basic contains a basic open-addressing hash table using
84 linear probing as the collision strategy. This should currently be the
85 fastest available hash table implementation for lookups, although it has a
86 higher memory overhead than others.
87 * Data.HashTable.ST.Cuckoo contains an implementation of "cuckoo hashing".
88 Cuckoo hashing has worst-case O(1) lookups and performs well even when the
89 table is highly loaded.
90 * Data.HashTable.ST.Linear contains a linear hash table, which trades some
91 insert and lookup performance for higher space efficiency and much shorter
92 delays when expanding the table.
93 .
94 ${haskell:Blurb}
95
96 Package: libghc-hashtables-doc
97 Architecture: all
98 Section: doc
99 Depends:
100 ${haskell:Depends},
101 ${misc:Depends},
102 ${shlibs:Depends},
103 Recommends:
104 ${haskell:Recommends},
105 Suggests:
106 ${haskell:Suggests},
107 Provides:
108 ${haskell:Provides},
109 Description: mutable hash tables -- documentation${haskell:ShortBlurb}
110 This package provides a couple of different implementations of mutable hash
111 tables in the ST monad, as well as a typeclass abstracting their common
112 operations, and a set of wrappers to use the hash tables in the IO monad.
113 .
114 There are three hash table implementations:
115 .
116 * Data.HashTable.ST.Basic contains a basic open-addressing hash table using
117 linear probing as the collision strategy. This should currently be the
118 fastest available hash table implementation for lookups, although it has a
119 higher memory overhead than others.
120 * Data.HashTable.ST.Cuckoo contains an implementation of "cuckoo hashing".
121 Cuckoo hashing has worst-case O(1) lookups and performs well even when the
122 table is highly loaded.
123 * Data.HashTable.ST.Linear contains a linear hash table, which trades some
124 insert and lookup performance for higher space efficiency and much shorter
125 delays when expanding the table.
126 .
127 ${haskell:Blurb}