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.


Keywords
data, deprecated, library, Propose Tags, Skip to Readme, , Index, Data.HashMap, Data.HashSet, More info, hashmap-1.3.3.tar.gz, browse, Package description, Package maintainers, MilanStraka, ryanglscott, edit package information , unordered-containers
License
BSD-3-Clause
Install
cabal install hashmap-1.3.3

Documentation

hashmap

Hackage Hackage Dependencies Haskell Programming Language BSD3 License Build

⚠️ 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.