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.


Keywords
data, library, Propose Tags , Data.HashMap.Internal, Data.HashMap.Internal.Array, Data.HashMap.Internal.List, Data.HashMap.Internal.Strict, Data.HashMap.Internal.Unsafe, Data.HashMap.Lazy, Data.HashMap.Strict, Data.HashSet, Data.HashSet.Internal
License
BSD-3-Clause
Install
cabal install unordered-containers-0.2.10.0

Documentation

unordered-containers

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.

For developer and contributor documentation see the Developer Guide.