unordered-containers: Efficient hashing-based container types
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- [option-o2] 'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.
- [missing-upper-bounds] On library, these packages miss upper bounds: - deepseq Please add them. There is more information at https://pvp.haskell.org/
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.
Properties
Modules
[Index] [Quick Jump]
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| debug | Enable debug support | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- unordered-containers-0.2.20.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees