hashmap: Persistent containers HashMap and HashSet.

[ bsd3, data, deprecated, library ] [ Propose Tags ] [ Report a vulnerability ]
Deprecated in favor of unordered-containers

An implementation of persistent HashMap and HashSet on top of Data.IntMap.IntMap and Data.IntSet.IntSet, with very similar API. It uses Hashable class from the hashable package for hashing.

The HashMap key value is an Data.IntMap.IntMap indexed by the hash value, containing Data.Map.Map key value for all keys with the same hash value.

The HashSet elem is an Data.IntMap.IntMap indexed by the hash value, containing Data.Set.Set elem for all elements with the same hash value.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.9.0, 1.0.0, 1.0.0.1, 1.0.0.2, 1.0.0.3, 1.1.0, 1.1.0.1, 1.2.0.0, 1.2.0.1, 1.3.0.0, 1.3.0.1, 1.3.1, 1.3.1.1, 1.3.2, 1.3.3
Change log CHANGES
Dependencies base (>=4.0 && <5), containers (>=0.3), hashable (>=1.0) [details]
License BSD-3-Clause
Author Milan Straka
Maintainer fox@ucw.cz
Category Data
Home page http://git.auryn.cz/haskell/hashmap/
Uploaded by MilanStraka at 2011-04-19T13:21:24Z
Distributions Debian:1.3.3, LTSHaskell:1.3.3, NixOS:1.3.3, Stackage:1.3.3
Reverse Dependencies 12 direct, 3 indirect [details]
Downloads 18202 total (105 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]