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

[ data-structures, library, mit ] [ Propose Tags ] [ Report a vulnerability ]

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.

Flags

Manual Flags

NameDescriptionDefault
with-sizeableDisabled
test-propertiesEnabled
test-strictDisabled

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

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.9, 0.9.1, 0.9.2, 1.0.0, 1.0.1.1
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 (uwe@fh-wedel.de), Sebastian Philipp (sebastian@spawnhost.de)
Category Data Structures
Bug tracker https://github.com/sebastian-philipp/StringMap/issues
Source repo head: git clone https://github.com/sebastian-philipp/StringMap.git
Uploaded by UweSchmidt at 2014-02-27T15:48:32Z
Distributions
Reverse Dependencies 4 direct, 1 indirect [details]
Downloads 5025 total (19 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [all 1 reports]