unordered-containers: Efficient hashing-based container types

[ bsd3, data, library ] [ Propose Tags ]

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.

Versions 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.3.0, 0.1.4.0, 0.1.4.1, 0.1.4.2, 0.1.4.3, 0.1.4.4, 0.1.4.5, 0.1.4.6, 0.2.0.0, 0.2.0.1, 0.2.1.0, 0.2.2.0, 0.2.2.1, 0.2.3.0, 0.2.3.1, 0.2.3.2, 0.2.3.3, 0.2.4.0, 0.2.5.0, 0.2.5.1, 0.2.6.0, 0.2.7.0, 0.2.7.1, 0.2.7.2, 0.2.8.0, 0.2.9.0
Dependencies base (<4.5), deepseq (==1.1.*), hashable (>=1.0.1.1 && <1.2) [details]
License BSD-3-Clause
Copyright (c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 (c) 2010-2011 Johan Tibell
Author Johan Tibell <johan.tibell@gmail.com>
Maintainer johan.tibell@gmail.com
Category Data
Bug tracker https://github.com/tibbe/unordered-containers/issues
Source repo head: git clone https://github.com/tibbe/unordered-containers.git
Uploaded by JohanTibell at Wed Aug 3 05:02:12 UTC 2011
Distributions Arch:0.2.9.0, Debian:0.2.5.1, Fedora:0.2.8.0, FreeBSD:0.2.5.1, LTSHaskell:0.2.9.0, NixOS:0.2.9.0, Stackage:0.2.9.0, openSUSE:0.2.9.0
Downloads 361840 total (637 in the last 30 days)
Rating 2.5 (votes: 5) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees