Deprecated

In favour of

hashmap

Persistent containers Map and Set based on hashing.

Version on this page:	1.3.2
LTS Haskell 24.16:	1.3.3
Stackage Nightly 2025-10-24:	1.3.3
Latest on Hackage:	1.3.3

See all snapshots hashmap appears in

BSD-3-Clause licensed by Milan Straka

Maintained by Ryan Scott

This version can be pinned in stack with:hashmap-1.3.2@sha256:b41e6923c4dc35dfeab94c6c079e26d668eb57a43030ff6fa8852186bf565b9d,2482

Module documentation for 1.3.2

Data
- Data.HashMap
- Data.HashSet

Depends on 4 packages(full list with versions):

base, containers, deepseq, hashable

`hashmap`

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