An efficient implementation of maps from strings to arbitrary values
|Latest on Hackage:||188.8.131.52|
This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
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.