Package0.2.21Data
unordered-containers
Efficient hashing-based container types
- Version0.2.21
- CategoryData
- LicenceBSD-3-Clause
- AuthorJohan Tibell
- Maintainersimon.jakobi@gmail.com, David.Feuer@gmail.com
- Homepagegithub.com/haskell-unordered-containers/unordered-containers
- Pinned byhackage unordered-containers 0.2.21
- Sourcehackage.haskell.org/package/unordered-containers-0.2.21
Modules
9 modulesDescription
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.
Security
This package currently provides no defenses against hash collision attacks such as HashDoS. Users who need to store keys derived from untrusted input are advised to use Data.Map or Data.Set from the containers package instead.
Depends on
4 packages- base-4.23.0.0with GHC
- deepseq-1.5.2.0with GHC
- hashable-1.5.1.0in this set
- template-haskell-2.25.0.0with GHC