The data-stringmap package

[Tags: library, mit]

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.


Versions0.9, 0.9.1, 0.9.2, 1.0.0,
Change logNone available
Dependenciesbase (>=4.5 && <5), binary (>=0.5), containers (>=0.4), deepseq (>=1.2)
AuthorUwe Schmidt, Sebastian Philipp,
CategoryData Structures
Bug tracker
Source repositoryhead: git clone
UploadedTue Oct 29 09:11:09 UTC 2013 by SebastianPhilipp
Downloads1174 total (92 in last 30 days)
StatusDocs available [build log]
Successful builds reported [all 1 reports]




Maintainers' corner

For package maintainers and hackage trustees