unordered-containers
Version 0.2.20 revision 4 uploaded by Bodigrim.
Package meta
- 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.
Security
This package currently provides no defenses against hash collision attacks such as HashDoS. Users who need to store input from untrusted sources are advised to use
Data.MaporData.Setfrom thecontainerspackage instead.- Author
- Johan Tibell
- Bug reports
- https://github.com/haskell-unordered-containers/unordered-containers/issues
- Category
- Data
- Copyright
- 2010-2014 Johan Tibell 2010 Edward Z. Yang
- Homepage
- https://github.com/haskell-unordered-containers/unordered-containers
- Maintainer
- simon.jakobi@gmail.com, David.Feuer@gmail.com
- Package URL
- n/a
- Stability
- n/a