The hashmap package

[Tags:bsd3, deprecated, library]
Deprecated. in favor of unordered-containers

An implementation of persistent Map and Set containers based on hashing. The implementation is build on top of Data.IntMap.IntMap and Data.IntSet.IntSet, with very similar API. It uses Hashable class from the hashable package for hashing.

This package can be used as a drop-in replacement for Data.Map and Data.Set modules.

The Map key value is an Data.IntMap.IntMap indexed by the hash value, containing either one (key, value) or a Data.Map.Map key value for all keys with the same hash value.

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

Properties

Versions 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
Change log CHANGES
Dependencies base (>=4.0 && <5), containers (>=0.3), hashable (>=1.0) [details]
License BSD3
Author Milan Straka
Maintainer fox@ucw.cz
Stability Provisional
Category Data
Home page http://git.auryn.cz/haskell/hashmap/
Uploaded Wed Sep 21 09:38:02 UTC 2011 by MilanStraka
Distributions Debian:1.3.0.1, LTSHaskell:1.3.1.1, NixOS:1.3.1.1, Stackage:1.3.1.1, Tumbleweed:1.3.1.1
Downloads 4599 total (38 in the last 30 days)
Votes
1 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees