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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
|
name: unordered-containers
version: 0.2.10.0
synopsis: Efficient hashing-based container types
description:
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.
license: BSD3
license-file: LICENSE
author: Johan Tibell
maintainer: johan.tibell@gmail.com
Homepage: https://github.com/tibbe/unordered-containers
bug-reports: https://github.com/tibbe/unordered-containers/issues
copyright: 2010-2014 Johan Tibell
2010 Edward Z. Yang
category: Data
build-type: Simple
cabal-version: >=1.10
extra-source-files: CHANGES.md
tested-with: GHC==8.4.1, GHC==8.2.2, GHC==8.0.2, GHC==7.10.3, GHC==7.8.4
flag debug
description: Enable debug support
default: False
library
exposed-modules:
Data.HashMap.Lazy
Data.HashMap.Strict
Data.HashSet
other-modules:
Data.HashMap.Array
Data.HashMap.Base
Data.HashMap.Strict.Base
Data.HashMap.List
Data.HashMap.Unsafe
Data.HashMap.UnsafeShift
Data.HashSet.Base
build-depends:
base >= 4.7 && < 5,
deepseq >= 1.1,
hashable >= 1.0.1.1 && < 1.4
default-language: Haskell2010
other-extensions:
RoleAnnotations,
UnboxedTuples,
ScopedTypeVariables,
MagicHash,
BangPatterns
ghc-options: -Wall -O2 -fwarn-tabs -ferror-spans
if impl (ghc < 8.2)
-- This is absolutely necessary (but not sufficient) for correctness due to
-- the referential-transparency-breaking mutability in unsafeInsertWith. See
-- #147 and GHC #13615 for details. The bug was fixed in GHC 8.2.
ghc-options: -feager-blackholing
if flag(debug)
cpp-options: -DASSERTS
test-suite hashmap-lazy-properties
hs-source-dirs: tests
main-is: HashMapProperties.hs
type: exitcode-stdio-1.0
build-depends:
base,
containers >= 0.5.8,
hashable >= 1.0.1.1,
QuickCheck >= 2.4.0.1,
test-framework >= 0.3.3,
test-framework-quickcheck2 >= 0.2.9,
unordered-containers
default-language: Haskell2010
ghc-options: -Wall
cpp-options: -DASSERTS
test-suite hashmap-strict-properties
hs-source-dirs: tests
main-is: HashMapProperties.hs
type: exitcode-stdio-1.0
build-depends:
base,
containers >= 0.5.8,
hashable >= 1.0.1.1,
QuickCheck >= 2.4.0.1,
test-framework >= 0.3.3,
test-framework-quickcheck2 >= 0.2.9,
unordered-containers
default-language: Haskell2010
ghc-options: -Wall
cpp-options: -DASSERTS -DSTRICT
test-suite hashset-properties
hs-source-dirs: tests
main-is: HashSetProperties.hs
type: exitcode-stdio-1.0
build-depends:
base,
containers >= 0.4,
hashable >= 1.0.1.1,
QuickCheck >= 2.4.0.1,
test-framework >= 0.3.3,
test-framework-quickcheck2 >= 0.2.9,
unordered-containers
default-language: Haskell2010
ghc-options: -Wall
cpp-options: -DASSERTS
test-suite list-tests
hs-source-dirs: tests .
main-is: List.hs
other-modules:
Data.HashMap.List
type: exitcode-stdio-1.0
build-depends:
base,
containers >= 0.4,
QuickCheck >= 2.4.0.1,
test-framework >= 0.3.3,
test-framework-quickcheck2 >= 0.2.9
default-language: Haskell2010
ghc-options: -Wall
cpp-options: -DASSERTS
test-suite regressions
hs-source-dirs: tests
main-is: Regressions.hs
type: exitcode-stdio-1.0
build-depends:
base,
hashable >= 1.0.1.1,
HUnit,
QuickCheck >= 2.4.0.1,
test-framework >= 0.3.3,
test-framework-hunit,
test-framework-quickcheck2,
unordered-containers
default-language: Haskell2010
ghc-options: -Wall
cpp-options: -DASSERTS
test-suite strictness-properties
hs-source-dirs: tests
main-is: Strictness.hs
type: exitcode-stdio-1.0
build-depends:
base,
ChasingBottoms,
containers >= 0.4.2,
hashable >= 1.0.1.1,
QuickCheck >= 2.4.0.1,
test-framework >= 0.3.3,
test-framework-quickcheck2 >= 0.2.9,
unordered-containers
default-language: Haskell2010
ghc-options: -Wall
cpp-options: -DASSERTS
benchmark benchmarks
-- We cannot depend on the unordered-containers library directly as
-- that creates a dependency cycle.
hs-source-dirs: . benchmarks
main-is: Benchmarks.hs
type: exitcode-stdio-1.0
other-modules:
Data.HashMap.Array
Data.HashMap.Base
Data.HashMap.Lazy
Data.HashMap.Strict
Data.HashMap.Strict.Base
Data.HashMap.Unsafe
Data.HashMap.UnsafeShift
Data.HashSet
Data.HashSet.Base
Util.ByteString
Util.Int
Util.String
build-depends:
base >= 4.8.0,
bytestring,
containers,
criterion >= 1.0 && < 1.3,
deepseq >= 1.1,
deepseq-generics,
hashable >= 1.0.1.1,
hashmap,
mtl,
random
default-language: Haskell2010
ghc-options: -Wall -O2 -rtsopts -fwarn-tabs -ferror-spans
if flag(debug)
cpp-options: -DASSERTS
source-repository head
type: git
location: https://github.com/tibbe/unordered-containers.git
|
