The data-stringmap package

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

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.


Versions 0.9, 0.9.1, 0.9.2, 1.0.0,
Dependencies base (>=4.5 && <5), binary (>=0.5), containers (>=0.4), deepseq (>=1.2) [details]
License MIT
Author Sebastian Philipp, Uwe Schmidt
Category Data Structures
Bug tracker
Source repo head: git clone
Uploaded Tue Oct 29 08:40:13 UTC 2013 by SebastianPhilipp
Distributions NixOS:
Downloads 2479 total (38 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




Maintainer's Corner

For package maintainers and hackage trustees