total-maps: Dense and sparse total maps.

[ containers, data, data-structures, library, mit ] [ Propose Tags ]

Total maps are maps that contain a value for every key. This library provides various flavors of total maps.

Dense maps store values for all keys. Sparse maps store a default value and the values which differ from the default. Sparse maps trade the lack of Traversable for a very fast Foldable instance (if the data is really sparse).

Bounded maps require the key type to be enumerable and bounded (have a finite number of values) for most of their functionality. Subset maps do not require the key to be bounded, instead they are parametized by a finite set of valid keys. The key subset is retrieved with help of the excellent reflection library.

The Data.Total.Array modules provide total map implementations based on vectors. It should usually be faster then Maps, unless you need to adjust single elements.

Maps in this library provide most of their functions in typeclasses and so the modules are designed to be imported unqualified.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],,,
Change log
Dependencies adjunctions (>=4 && <5), base (>=4 && <5), base-compat (>=0.6), bytes (>=0.2 && <1), containers (>=0.3 && <1), distributive (<1), keys (>=3 && <4), linear (>=1.1 && <2), reflection (<3), semigroups (<1), vector (>=0.10 && <1) [details]
License MIT
Copyright 2015 Paweł Nowak
Author Paweł Nowak
Category Data, Data Structures, Containers
Source repo head: git clone
Uploaded by pawel834 at 2015-11-19T04:03:04Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2658 total (19 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2016-11-30 [all 2 reports]