text-trie: An efficient finite map from Text to values, based on bytestring-trie.
An efficient finite map from Text to values, based on bytestring-trie.
The implementation is based on big-endian patricia trees, like Data.IntMap. We first trie on the elements of Data.ByteString and then trie on the big-endian bit representation of those elements. Patricia trees have efficient algorithms for union and other merging operations, but they're also quick for lookups and insertions.
If you are only interested in being able to associate
strings to values, then you may prefer the
package which is faster for those only needing a
map-like structure. This package is intended for
those who need the extra capabilities that a trie-like
structure can offer (e.g., structure sharing to
reduce memory costs for highly redundant keys,
taking the submap of all keys with a given prefix,
contextual mapping, extracting the minimum and
maximum keys, etc.)
[Skip to Readme]
|Dependencies||base (>=4.5 && <4.13), binary (>=0.5.1 && <0.8.7), text (>=1.2.3 && <1.2.4) [details]|
|Copyright||Copyright (c) 2008--2019 wren gayle romano, 2019 michael j. klein|
|Author||wren gayle romano, michael j. klein|
|Category||Data, Data Structures|
|Source repo||head: git clone https://github.com/michaeljklein/text-trie.git|
|Uploaded||by lambdamichael at 2019-04-11T19:52:45Z|
|Downloads||787 total (9 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2019-04-11 [all 1 reports]