hashmap: Persistent containers Map and Set based on hashing.
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 valueData.IntMap.IntMap
indexed by the hash value, containing either one (key, value)
or a Data.Map.Map key value
The Set elemData.IntMap.IntMap indexed by
the hash value, containing either one elem or Data.Set.Set elem
[Skip to Readme]
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| oldcontainers | Use old version of containers where NFData instances are provided by deepseq. | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- hashmap-1.3.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
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), deepseq (>=1.0), hashable (>=1.0) [details] |
| Tested with | ghc ==7.0.4, ghc ==7.2.2, ghc ==7.4.2, ghc ==7.6.3, ghc ==7.8.4, ghc ==7.10.3, ghc ==8.0.2, ghc ==8.2.2, ghc ==8.4.1 |
| License | BSD-3-Clause |
| Copyright | (C) 2011-2012 Milan Straka, 2016 Ryan Scott |
| Author | Milan Straka |
| Maintainer | Ryan Scott <ryan.gl.scott@gmail.com> |
| Category | Data |
| Home page | https://github.com/foxik/hashmap |
| Bug tracker | https://github.com/foxik/hashmap/issues |
| Source repo | head: git clone https://github.com/foxik/hashmap |
| Uploaded | by ryanglscott at 2018-01-03T02:45:02Z |
| 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 | 18600 total (42 in the last 30 days) |
| Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2018-01-03 [all 1 reports] |
Readme for hashmap-1.3.3
[back to package description]hashmap
⚠️ 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.