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.
|Versions||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|
|Dependencies||base (<4.8), binary, bytestring [details]|
|Copyright||Copyright (c) 2008--2009 wren ng thornton|
|Author||wren ng thornton|
|Revised||Revision 1 made by phadej at Tue Apr 3 11:25:16 UTC 2018|
|Category||Data, Data Structures|
|Uploaded||by WrenThornton at Sat Jan 10 12:59:00 UTC 2009|
|Distributions||Fedora:0.2.4.1, LTSHaskell:0.2.4.1, NixOS:0.2.4.1, openSUSE:0.2.4.1|
|Downloads||12630 total (81 in the last 30 days)|
|Rating||2.25 (votes: 2) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
- bytestring-trie-0.1.3.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'.
For package maintainers and hackage trustees