unordered-containers

Version 0.2.19.1 revision 2 uploaded 2023-03-12T16:23:02.000Z by AndreasAbel.

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.Map or Data.Set from the containers package 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

Components

• lib:unordered-containers
• bench:benchmarks
• test:unordered-containers-tests