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

[ 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, 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@fh-wedel.de, 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 SebastianPhilipp at Tue Dec 3 21:29:43 UTC 2013
Distributions NixOS:1.0.1.1
Downloads 2505 total (13 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

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees