Skip to content

m-renaud/unordered-containers

 
 

Repository files navigation

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.

About

Efficient hashing-based container types

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages

  • Haskell 98.0%
  • C 2.0%