bytestring-trie: An efficient finite map from (byte)strings to values.
An efficient finite map from (byte)strings to values.
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]
- bytestring-trie-0.2.5.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
|Versions [RSS]||0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2.2, 0.2.3, 0.2.4, 0.2.4.1, 0.2.4.3, 0.2.5.0, 0.2.5.1, 0.2.5.2, 0.2.5.3, 0.2.6, 0.2.7|
|Dependencies||base (>=4.5 && <4.16), binary (>=0.5.1 && <0.8.8), bytestring (>=0.9.2 && <0.11) [details]|
|Copyright||Copyright (c) 2008--2019 wren gayle romano|
|Author||wren gayle romano|
|Revised||Revision 2 made by GershomBazerman at 2021-06-19T23:56:41Z|
|Category||Data, Data Structures|
|Source repo||head: git clone https://github.com/wrengr/bytestring-trie.git|
|Uploaded||by WrenRomano at 2019-02-26T04:22:55Z|
|Distributions||Fedora:0.2.5.0, LTSHaskell:0.2.7, NixOS:0.2.7, Stackage:0.2.7|
|Downloads||22467 total (144 in the last 30 days)|
|Rating||2.5 (votes: 4) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]