Efficient hashing-based container types
Haskell C
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
Data Formatting Aug 8, 2017
benchmarks Fix compilation of benchmarks Jun 8, 2016
cbits Don't `inline` popcount Mar 30, 2016
docs developer guide: document performance considerations Jun 16, 2017
tests Make Ord instance Eq compatible Jun 13, 2017
utils
.gitignore Add sandbox stuff to .gitignore Sep 24, 2015
.hgignore Build standalone benchmarks Oct 16, 2012
.travis.yml Drop GHC 7.6 and earlier Aug 8, 2017
CHANGES.md
LICENSE Initial import Dec 30, 2010
README.md
Setup.hs
unordered-containers.cabal Drop GHC 7.6 and earlier Aug 8, 2017

README.md

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.