data-stringmap: An efficient implementation of maps from strings to arbitrary values

[ data-structures, library, mit ] [ Propose Tags ]
Versions 0.9, 0.9.1, 0.9.2, 1.0.0,
Dependencies base (>=4.5 && <5), binary (>=0.5 && <1), containers (>=0.4 && <1), deepseq (>=1.2 && <2) [details]
License MIT
Author Uwe Schmidt, Sebastian Philipp
Maintainer Uwe Schmidt (, Sebastian Philipp (
Category Data Structures
Bug tracker
Source repo head: git clone
Uploaded by UweSchmidt at Thu Feb 27 15:48:32 UTC 2014
Distributions NixOS:
Downloads 2492 total (14 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [all 1 reports]
Hackage Matrix CI

An efficient implementation of maps from strings to arbitrary values. Values can associated with an arbitrary byte key. Searching for keys is very fast, but the prefix tree probably consumes more memory than Data.Map. The main differences are the special prefixFind functions, which can be used to perform prefix queries.





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


Maintainer's Corner

For package maintainers and hackage trustees