Source Package: ghc-unordered-containers (0.2.21-2.3)
Efficient hashing-based container types
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.
Package information
- Homepage
- [https://hackage.haskell.org/package/unordered-containers]
- License
- BSD-3-Clause
- Mainteneur du paquet aval
- Inconnu : non déclaré dans la source indexée
The following binary packages are built from this source package:
- ghc-unordered-containers
Efficient hashing-based container types
- ghc-unordered-containers-devel
Haskell unordered-containers library development files
- ghc-unordered-containers-doc
Haskell unordered-containers library documentation
- ghc-unordered-containers-prof
Haskell unordered-containers profiling library
