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 [faq]||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|
|Dependencies||base (<2.2 || >=3 && <4.8), binary, bytestring [details]|
|Copyright||Copyright (c) 2008--2010 wren ng thornton|
|Author||wren ng thornton|
|Revised||Revision 1 made by phadej at Tue Apr 3 11:28:07 UTC 2018|
|Category||Data, Data Structures|
|Uploaded||by WrenThornton at Thu Jun 10 23:42:29 UTC 2010|
|Downloads||13981 total (243 in the last 30 days)|
|Rating||2.5 (votes: 4) [estimated by rule of succession]|
Docs uploaded by user
Build status unknown [no reports yet]
base-4.0 deprecated Prelude which is imported qualified
Use optimized C implementation for indexOfDifference. See notes in Data.Trie.ByteStringInternal.
Applicative functors were added in base-2.0
The bytestring library was included in base-2.0 and base-2.1.1, but for base-1.0 and base-3.0 it was a separate package
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
- bytestring-trie-0.2.2.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