data-stringmap: An efficient implementation of maps from strings to arbitrary values
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.
Modules
[Index]
Downloads
- data-stringmap-0.9.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
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), containers (>=0.4), deepseq (>=1.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 2013-10-29T09:11:09Z |
| Distributions | |
| Reverse Dependencies | 4 direct, 1 indirect [details] |
| Downloads | 4928 total (16 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] |