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.


[Skip to Readme]

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, 1.3.2
Change log CHANGES
Dependencies base (>=4.0 && <5), containers (>=0.3), deepseq (>=1.0), hashable (>=1.0) [details]
License BSD3
Copyright (C) 2011-2012 Milan Straka, 2016 Ryan Scott
Author Milan Straka
Maintainer Ryan Scott <ryan.gl.scott@gmail.com>
Stability Provisional
Category Data
Home page https://github.com/foxik/hashmap
Bug tracker https://github.com/foxik/hashmap/issues
Source repository head: git clone https://github.com/foxik/hashmap
Uploaded Wed Nov 30 15:15:08 UTC 2016 by ryanglscott
Distributions Debian:1.3.0.1, LTSHaskell:1.3.2, NixOS:1.3.2, Stackage:1.3.2, Tumbleweed:1.3.1.1
Downloads 4754 total (105 in the last 30 days)
Votes
1 []
Status Docs available [build log]
Last success reported on 2016-11-30 [all 1 reports]

Modules

[Index]

Flags

NameDescriptionDefaultType
oldcontainersUse old version of containers where NFData instances are provided by deepseq.DisabledAutomatic

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for hashmap

Readme for hashmap-1.3.2

hashmap

Hackage Hackage Dependencies Haskell Programming Language BSD3 License Build

:warning: 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.